since we know that DP has no specific algorithm but it has several techniques. I don't know where to start from. should i solve some recursion and Divide and conquer problems before solving dynamic programming ? what should be the steps or order to follow to improve significantly in DP problem ASAP?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | atcoder_official | 156 |
| 4 | cry | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 7 | adamant | 154 |
| 9 | Um_nik | 151 |
| 10 | djm03178 | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/01/2024 07:14:24 (l2).
Desktop version, switch to mobile version.
Supported by
DP:
"Those who can not remember the past are condemned to repeat it"
topcoder link
dp problems(sort by solved)
should i solve problem using recursion before solving DP problem?
first try to solve with naive solution, then optimize by memorization
okay... thanks for the suggestion