Can you please give me a list of some simple 1-D dynamic programming problems which you did or practiced when you start learning dynamic programming.
thank you in advanced.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
Название |
---|
https://codeforces.me/gym/103149/problem/A
Starting problems of cses DP Section, Atcoder DP first few and random DP tagged codeforces problem (may or may not be very educational), here is one. You can find some gym contest made by errichto or other coders too on codeforces. You can find one of them in this blog.
Also a suggestion, it would be better to understand why you need 2D or more dimension "dp array" in first place. You will build intuition as you practice but having less DP states doesn't make a problem any easier.
thankyou so much
Atcoder Educational DP Contest
Codeforces Gym Problemset
Marathon DP vjudge
usaco guide
Here are the best resources to learn anything
You can find a DP in the gold Section
You can try (some problems require something like dp[n][2] or dp[n][4])
https://codeforces.me/contest/180/problem/C https://codeforces.me/contest/234/problem/C https://codeforces.me/contest/1420/problem/C1 https://codeforces.me/contest/1526/problem/C1 https://codeforces.me/contest/166/problem/E https://codeforces.me/contest/545/problem/C https://codeforces.me/contest/1272/problem/D https://codeforces.me/contest/1061/problem/C
Or just dp-tagged problems with difficulty from 1200 to 1500