I know basic data structures like an array, vector,pair..etc. I also practice some recursion functions, but not good at analyzing the complexity of my functions!
№ | Пользователь | Рейтинг |
---|---|---|
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 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Название |
---|
Improve your complexity analysis first, and learn other algorithms such as binary search and prefix sums. Dynamic Programming is an intermediate/advanced topic that requires familiarity with time complexity and common data structures. If you're looking for a general roadmap, consider the USACO guide: https://usaco.guide/. As you can see, even basic DP is in gold, so you should save that until after you've learnt more algorithms and solved more problems.
Recursion helps a lot to understand the DP concept.
Mind
Lmao