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!
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
Name |
---|
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