A very familiar niche of dp problemset is the subsequence problemset . But , there are a wide range of questions related to subarrays , that can be solved using dp. Please suggest me some resources for the problems related to subarrays , which can be solved using dp.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/24/2026 05:30:10 (i1).
Desktop version, switch to mobile version.
Supported by
The whole idea of dynamic programming is that you take a big problem(a big array) and you solve the same problem for a subproblem of it(a subarray) and after you use the solution of the subproblem to solve the big problem. So maybe the best you can do now, is to read some classic dp problems like (edit distance, coin-change problem, knapsack, LCS) and after solve many dp problems. I suggest you to use a2oj. Go to "Categories" and select "Dynamic programming". Start from difficulty 1 and if you find it easy jump to the next difficulty.
Good luck !