| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
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.net/blog/entry/8219
Thank you Redux, interesting problems indeed
This one has some preatty difficult tricks. https://codeforces.net/blog/entry/47764
Thank you MvC, I didn’t know that there are such nice blogs on codeforces.