The thing I found out is that to solve any dp problem, I just need to find the recurrence relation, nothing else. How can I build my brain to be strong enough to find any dp relation? Any blog or video or advice for that, please?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 156 |
| 7 | adamant | 151 |
| 7 | djm03178 | 151 |
| 7 | luogu_official | 151 |
| 10 | awoo | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/23/2025 14:58:29 (i1).
Desktop version, switch to mobile version.
Supported by
You should just open the page called "Problemset", add "dp" tag, and start solving problems shown up there in order of difficulty. If you have no ideas for about 20-30 minutes, you can check an editorial. There is no "magic" techniques on how to solve any dp problem. You can only get stronger by practicing. I recommend to check this video. There are some problems and basic techniques.