# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 149 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | cry | 143 |
Name |
---|
This can help you,
https://mirror.codeforces.com/blog/entry/65555?#comment-495656
Can you please explain the logic how to store dp[x][y].I am unable to understand the logic mentioned in the above link comment section.
You can apply the knapsack type DP approach to fill the table. The main logic For finding DP[x][i] you can take j = 1 to i values from current DP and take remaining (i-j) values from it's child DP and update current DP.