I am facing difficulties on solving dp problem of question with rating 1600+ . Please suggest me some resources by which I can solve the problems based on DP in range 1600-1800.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
I am facing difficulties on solving dp problem of question with rating 1600+ . Please suggest me some resources by which I can solve the problems based on DP in range 1600-1800.
Название |
---|
CSES and its editorial
Just check the introduction dp page under the USACO Guide gold section.
To get good at dp I did some LeetCode hard dp problems and Hackerrank dp problems. But I think for 1600-1800 problems you only need to know basic DP and Knapsack DP, + reconstruction of an optimal solution. But it's fun to learn the other common ones like bitmask DP, digit DP, etc.