https://codeforces.com/blog/entry/79376 I have solved this problem using other method but I'm unable to understand dynamic programming solution. I'm not able to write recursive solution also. Any help will be greatly appreciated.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Need help in understanding dp solution to this problem
https://codeforces.com/blog/entry/79376 I have solved this problem using other method but I'm unable to understand dynamic programming solution. I'm not able to write recursive solution also. Any help will be greatly appreciated.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | vpinmrcool | 2021-02-03 10:41:20 | 2 | Tiny change: 'ositions\nI have s' -> 'ositions\n\nI have s' | ||
en2 | vpinmrcool | 2021-02-03 10:39:29 | 65 | |||
en1 | vpinmrcool | 2021-02-03 09:14:12 | 288 | Initial revision (published) |
Name |
---|