### amsen's blog

By amsen, history, 7 years ago,

How to become strong and expert in DP ?

can any body tell me some problems and some links to read ?

thanks all!

• -3

 » 7 years ago, # |   0 DP for Dynapic Programming?
•  » » 7 years ago, # ^ |   +10 No, It's for Dynamic Programming.
•  » » » 7 weeks ago, # ^ |   0 No, It,s for Display Picture ;)
 » 7 years ago, # |   +9 I suggest to you reading this article with practicing examples mentioned in it.https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/
 » 7 years ago, # |   +1 I'd suggest you reading Nicolaus Wirt — "Algorithms and Data Structures". Chapter "Dynamic Programming"
 » 7 years ago, # |   0 Practice makes perfect.
 » 7 years ago, # |   0 The core of DP is to turn the problem into a formula, to generate an new algorithm. It is likely that 100 DP problems have 101 formulas(by my friend). So actually, the only way to improve DP skill is to practice more and AC different kind of DP.
•  » » 7 years ago, # ^ |   0 could you please say me some problems in any online judges?
•  » » » 7 years ago, # ^ |   0 (⊙ˍ⊙)I'm a Chinese ACMer, I mainly solve some problems on Chinese OJ. You can find many DP problems through the tag in 'Problem Set' on CF. I learn my DP skill on this page problem ID 1003(largest sub-string) 1081(largest sub-rectangle) 1159(longest common sub-sequence) 1025(longest increasing sub-sequence) 2602 1059(two package problem) is some primary problem. If you are satisfied with the problem, you may solve other problem on the list, just skip ones with Chinese description. It may be hard for you to find the solution as you can't read others' solution on HduOJ. HUST is another big OJ in China, you may register an account and search the solution in 'STATUS' (OJ 'HDU' 'Accepted'), you can see the code of solution by clicking green ones below language.
•  » » » 3 years ago, # ^ |   -6 Now you are master, can you please tell how you improve your dp?
•  » » » 3 years ago, # ^ |   +4 Any tips to improve everything including dp?.. except practice what else??
•  » » » » 3 years ago, # ^ |   +3 except practice what else??Get a brain transplant (if that is even possible). That's pretty much all you need. My condolences that God didn't give you a brain that is as good as those of red coders. Lmao.On a more serious note, please get a life. Not everyone is suited for CP.
•  » » » » » 3 years ago, # ^ | ← Rev. 2 →   -18 Haha..bro I have a life and pls focus on your life and moreover this question was not for you and still you answered (and that too with a fake account) so that shows what kind of life you r living right now...lol
 » 7 years ago, # |   0 Just with one thing. "Practice"There are lots of problem about DP on codeforces , LightOJ or other websites.You can start with easiest one. Then you will see you are improving day by day.
 » 7 years ago, # |   0 try these primary level DP problems posted by ThunderStroke i this blog they really helped me to start with DP .
 » 7 years ago, # |   +1 solve the problems in these answers on Quorawhen you are thinking about the solution try to solve it with recursion and memorization,don't submit the recursion/memorization solution,after your solution is right you can easily convert it to DP.Don't forget to practice a lot ,because better results needs hard working :)I'm telling you to do this because this is the strategy to start DP(because DP is an optimization for recursion),sorry for my bad English.
•  » » 7 years ago, # ^ |   0 Is there any resource how to convert memoization to DP?
•  » » » 7 years ago, # ^ |   0 Just think about what dp results you need to construct some larger dp result. In recursion, you would say something like: dp(k)= dp(k-1) + dp(k-2) If you think about program flow, once the function dp hits its base cases, then it starts returning answers to increasingly larger problems. So you know later indices depend only on earlier ones, so you iterate from earliest to latest indices in your recursion.
•  » » » 7 years ago, # ^ |   +1 Try reading this...Read some solutions in recursion and DP (the solution is for the same problem) and you'll understand... It may be hard in the beginning...,but don't stop practicing :)sorry for my bad English
 » 3 years ago, # |   +41 Now you are master can u tell how u did it??
 » 3 years ago, # |   +1 Here some questions. My teacher gave them to me. And I be better at Dp.Number of waysDaemon and wifigiven length and sum of digitsquasi binaryBoredomultra-fast mathematiciansoldier and number gameFlowersPasswordCaesar's LegionsBarcodeMr. Kitayuta, the Treasure Hunter Pashmak and GraphRed-Green Towers Little Pony and Harmony ChestHope you enjoy :))
•  » » 12 months ago, # ^ |   -12 really very good questions , thanks
 » 12 months ago, # |   -79 I can teach you lessons on dp. But it will cost 100\$ per lesson. Believe me you'll be the best in dp.You maybe will beat tourist after my lessons.
•  » » 12 months ago, # ^ |   +7 I need you to teach me how to become strong in self confidence :)
•  » » 7 months ago, # ^ |   +1 Interesting
•  » » 7 weeks ago, # ^ |   0 Ok.can you teach me ?
 » 12 months ago, # |   +35 Since necroposting this became the new thing, i just want to point out how cool it is to see people blogs of people asking relatively simple stuff that became orange/red a couple of years later