Hello guys,
I am facing difficulties solving DP problems. It's like i am not able to do even the easy ones.
I know some classical problems and have even solved other problems on DP but i am not improving i guess.
I don't get to the correct DP states even after thinking for a while.
Any advice would be appreciated. Thanks.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/13/2024 05:36:29 (k3).
Desktop version, switch to mobile version.
Supported by
Open Problemset, select DP tag, Sort by Solved, Think on every problem 90 minutes, If you couldn't Solve it, Read tutorial.
I think Dynamic Programming is really a quite difficult topic (at least for me). Sometimes it is really tough to figure out how to construct correct states and deduce the recursive formula. Perhaps this it not like solving an equation, for instance, ax2 + bx + c = 0, which we have some "systematic" steps to follow. Well, it seems that DP is more related with "intuitive understanding"...
I think you can start with some classical DP problems, such as backpack problem, Pascal's triangle, and so on. Next, you should keep practicing and solving new problems, and as you practice more, you will get some more clear understanding about this technique.
As for me, at first I could not understand bit-mask DP at all, however after I solved several problems (follow tutorials), I found that I could also handle some simple bit-mask DP problems. I think most of the master coders also suffered a lot when they started learning new techniques. Sometimes perhaps we only see their success, but do not realize that they have also worked quite hard. Believe yourself :D
Practice makes perfect.
Try solving problems of mathematical induction. And learn induction if you don't know already :)