Can anyone suggest some basic DP problems (must be on Codeforces) for me to solve? I want to have a try.
Can anyone suggest some basic DP problems (must be on Codeforces) for me to solve? I want to have a try.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
I think, you'd better not try according to your current rating... You'd better solve some problems using basic programming skills.
agree
dont think you should judge him by his rating, it seems that he is intentionally failing contest..
disagree
https://cses.fi/problemset/list/ Dp section has some classic dp problems
I stuck at problem Coin Combinations II and Book Shop because of TLE. I think the constrain of n upto 1e6 is the reason but i can't speed up my solution fast enough to pass all tests. Could you help me?
In coin combination my solution is O(x*n) but I implemented it bottom and bookshop is classic knapsack in O(x*n) too and you don't need to save O(x*n) state but only previous state.have you implemented your solution in top down or bottom up dp ?
You can look this site: At Coder Dp Round:
K-tree
Cut Ribbon
I can find 2 problems for you but you can choose dp tag in codeforces and sort by difficulty level.
And in this link you can find many question about dp
Dp Problem Tag in a2oj
And there is a difficulty level in the near of problem.
Please stop this, please.