Hi I am From Syr and I am New at programming and I've Trained on some subjects like : graph , dfs, bfs , dijkstra , and more . but I dont Now What Is the best Way to be good at Dynamic Programming can you help me and I will be thankful .......
# | 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 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Hi I am From Syr and I am New at programming and I've Trained on some subjects like : graph , dfs, bfs , dijkstra , and more . but I dont Now What Is the best Way to be good at Dynamic Programming can you help me and I will be thankful .......
Name |
---|
The best way to be good at some topic is to solve a lot of problems of that topic.
Update: You can try to solve some problems under DP tag from timus or lightoj. I like those problems very much!
I'm not expert but I can say that the best way to be good at dynamic is solving lots of problems and in codeforces there are lots of problems about dynamic programming
You are technically an expert ;)
if you don't now .. join liberland
yeeeh join liberland :) :) :)
I learned by this method first we write complete search with recursion and convert to memorization. I think this method is good for beginners
I think this is a good DP introduction. There are videos + nice explanation
http://people.cs.clemson.edu/~bcdean/dp_practice/
hmm.. good classical problems about DP , do you know a similar site (not necessarly the same author) that contains classical problems of other topics (graphs, geometry etc ..)
a2oj.com has a nice collection of problems on all programming related topics along with their difficulty levels.
thanks !