| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3947 |
| 2 | jiangly | 3734 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | ecnerwala | 3581 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | ksun48 | 3479 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 162 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | adamant | 156 |
| 5 | cry | 155 |
| 5 | atcoder_official | 155 |
| 5 | -is-this-fft- | 155 |
| 8 | maroonrk | 153 |
| 9 | SecondThread | 147 |
| 10 | Petr | 146 |
Hello everyone!
I feel i am bit bad towards mathematical side. I want to solve a lot of problems on DP and recurrences. And various techniques used in solving DP problems (DP optimizations). Where should I go about? From where do I get the specific set of problems to solve.
Thanks, any help will be appreciated!
Codeforces has a variety of problems on DP of varying difficulty.
Furthur , problems on DP are categorised on A2OJ.
But , before that you may want to check out resources on DP to read.
1) Quora
2)TopCoder
3)Threads@TopCoder