DP - help please...

Zyaad Jaunnoo · Post by **Zyaad Jaunnoo** » Thu Mar 24, 2005 9:23 pm

I can solve the classical DP problems and I got the solution to some Ad Hoc ones but unfortunately some are really hard to find (the recurrence formula). What shall we know (master)

in prior to 'easily' solve the DP problem?
Is there any link that starts with some very easy DP problems and goes to hard ones?

yaro · Post by **yaro** » Thu Mar 24, 2005 10:53 pm

http://www.topcoder.com/tc?module=Stati ... d2=dynProg

I think this may be interesting for you.

Zyaad Jaunnoo · Post by **Zyaad Jaunnoo** » Fri Mar 25, 2005 8:02 am

Thank you Yaro... no doubt that will help.
By the way, you know any website other than the UVA/Top Coder/USACO where I can get some DP problems?
Hope am not asking too much...

yaro · Post by **yaro** » Fri Mar 25, 2005 1:28 pm

You can try these:

http://spoj.sphere.pl
http://acm.zju.edu.cn/

The problems are not divided into categories like DP, graphs etc.
It is your task to determine whether the problem can be solved by DP or greedy, or in other way. You just need to read some of them and think about the method which should work there.

Tomislav Novak · Post by **Tomislav Novak** » Mon Mar 28, 2005 4:55 pm

yaro wrote:http://www.topcoder.com/tc?module=Stati ... d2=dynProg

I think this may be interesting for you.

Is there anything that covers more advanced DP problems?

Zyaad Jaunnoo · Post by **Zyaad Jaunnoo** » Mon Mar 28, 2005 10:05 pm

Thank you very much Yaro.. that will hep. May be the DP problems from the IOI are more advanced..