Page 1 of 1
Tell me some DP problems in Vol I--Vol VII
Posted: Wed May 21, 2003 10:30 am
by tzzx
could some tell me some DP problems in Vol I--Vol VII?
and list them with kinds or difficults
such as
easy ones:
difficule ones:
useful ones:
be helpful to the beginner ones:
thanks a lot.
Posted: Wed May 21, 2003 12:15 pm
by Observer
!!!!!!
How about providing some DP tutorial sites as well?
(I wanna learn DP @_@ )
Posted: Tue May 27, 2003 5:10 am
by rjhadley
The following are some problems which can be solved using dynamic programming:
103: Stacking Boxes
111: History Grading
147: Dollars
348: Optimal Array Multiplication Sequence
357: Let Me Count The Ways
497: Strategic Defense Initiative
562: Dividing Coins
674: Coin Change
711: Dividing Up
10032: Tug Of War
10405: Longest Common Subsequence
10482: The Candyman Can
348, 674, 10405 are problems typically found in dynamic programming texts/references (i.e. easier problems). I'm not aware of any online references to recommend though. 111 and 497 are probably a couple of harder ones in the list. [I haven't tried 103 yet, I've just briefly read the description].
Posted: Tue May 27, 2003 6:29 am
by anupam
another good problem is "Is bigger smater"
"supersale".
--
anupam
Posted: Tue May 27, 2003 6:32 am
by anupam
another good problem is "Is bigger smater"
"supersale".
--
anupam
Posted: Tue May 27, 2003 8:06 am
by tzzx
Thank you all!!!!