becoming a maestro of DP

[andysoft]

Hi everyone!
It is well known that the only way to solve DP problems at the contest is to have very many DP problems already solved before, to have practice.
I am now preparing to all-country contest... and the main topic is probably DP. I want to ask those who has already solved very many problems in the UVa problemset: can you advice me good (or any) Dynamic Programming problems from the problemset. I surely know those that are mentioned in the "Art of the Programming Contest", I just want to learn some new numbers from probably the newer contest volumes.

Thanks in advance
andy

[Anindya]

Well,I think the following ones may help you:

10910 - Marks Distribution
10911 - Forming Quiz Teams
10912
10913 - Walking on a Grid
10918 - Tri Tiling
10930 - A-Sequence
10943
10954 - Add All
10980 - Lowest Price in Town
10990 - Another New Function
11000 - Bee
11002 - Towards Zero
11008 - Antimatter Ray Clear.
11022 - String Factoring
11026 - A Grouping Problem
11031 - Looking for a Subset
11038 - How Many O's?
11040 - Add bricks in the Wall
11052 - Economic Phone Calls
11077 - Find the Permutations
11081 - Strings
11084 - Anagram Division
11091 - How many Knight
11125 - Arrange Some Marbles

Give them a try & u can also find more in shygypsy.com.

[Hadi]

You might also try practicing at topcoder: DP Problems at topcoder.
There is also a problem classification at acm.zju.edu.cn/forum.

Enjoy ^_^

[andysoft]

Thank you guys for your help, look forward to summer when I will have much time for solving, but now I will do it too.

[andysoft]

how about some more problems?

[sohel]

You can find the extensive list at Abednego's Site.

[greve]

Also try my site http://uvatoolkit.com/problemssolve.php (search for DP).

[nymo]

To greve, Its a very useful site you 've there... Thanks.