Tell me some DP problems in Vol I--Vol VII

tzzx · Post by **tzzx** » Wed May 21, 2003 10:30 am

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.

Observer · Post by **Observer** » Wed May 21, 2003 12:15 pm

!!!!!!

How about providing some DP tutorial sites as well?

(I wanna learn DP @_@ )

rjhadley · Post by **rjhadley** » Tue May 27, 2003 5:10 am

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].

anupam · Post by **anupam** » Tue May 27, 2003 6:29 am

another good problem is "Is bigger smater"
"supersale".
--
anupam

anupam · Post by **anupam** » Tue May 27, 2003 6:32 am

another good problem is "Is bigger smater"
"supersale".
--
anupam

tzzx · Post by **tzzx** » Tue May 27, 2003 8:06 am

Thank you all!!!!