sir..i am dp beginner....i solved the following problem with brute-force.....but i want to know approach for DP solutions.....
pls explain the approach clearly...
thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 149 |
6 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
sir..i am dp beginner....i solved the following problem with brute-force.....but i want to know approach for DP solutions.....
pls explain the approach clearly...
thanks in advance
Name |
---|
Ok, lets calc value dp[i] — maximum number of peaces we can cut rope with length i.
How to calc it?
Let's look to last peace. It can have length a, b or c. If we know length of last peace we can reduse problem to probl with smaller i.
For example, it length of last peace is a answer equal to dp[i-a]+1.
But we can choose any of three types of peaces so we need to take best.
And we get a formula:
dp[i]=max(dp[i-a],dp[i-b],dp[i-c])+1
could you pls help with a c/c++ code.....i would be soo greatful