can anyone help me with knapsack 0/1 dp problemset or any other resource? or you can just comment the problem you think would be good for learning knapsack dp. i am not able to solve advanced problems in knapsack dp. thanks!!
can anyone help me with knapsack 0/1 dp problemset or any other resource? or you can just comment the problem you think would be good for learning knapsack dp. i am not able to solve advanced problems in knapsack dp. thanks!!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 130 |
You can try solving these two problems: Easier version: https://atcoder.jp/contests/dp/tasks/dp_d Harder version due to larger constraints: https://atcoder.jp/contests/dp/tasks/dp_e
Good luck!