In many dp, such as knapsack, there is a often a state dp[i][...] such that i is first i numbers. Why is that? Why might it be so convenient for such a state?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
It is usually related to the way you define your dp.. But often it's easier to solve knapsack related problems using this method...
Or, you have solved very few problems maybe?
If you have some problem which
Then, to solve that problem, we first solve for N = 0, and add X1, X2, X3, and so on... This is the basic concept of DP and mathematical induction.
Of course, we don't have any reason to add it in random order, so we add from first, second, and to last.