| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 158 |
| 5 | nor | 153 |
| 5 | maroonrk | 153 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
Hi Codeforces,
I really like dynamic programming and I wanted to ask you, if maybe you know some interesting problems to solve using dynamic programming. Some hard once so I have to learn from :)
I hope this is going to be useful for others as well because I saw that DP problems are popular in every kind of programming contests.
Thank you in advance
This note on dp optimization techniques might be interesting for you.
http://maratona.ic.unicamp.br/MaratonaVerao2017/documents/dp.pdf
This blog also. https://codeforces.com/blog/entry/8219
Thank you Redux, interesting problems indeed
This one has some preatty difficult tricks. https://codeforces.com/blog/entry/47764
Thank you MvC, I didn’t know that there are such nice blogs on codeforces.