DP - help please...

Let's talk about algorithms!

Moderator: Board moderators

Post Reply
Zyaad Jaunnoo
Experienced poster
Posts: 122
Joined: Tue Apr 16, 2002 10:07 am

DP - help please...

Post by Zyaad Jaunnoo »

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) :o 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
New poster
Posts: 17
Joined: Sat Jan 03, 2004 3:18 pm
Location: Poland

Post by yaro »

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

I think this may be interesting for you.

Zyaad Jaunnoo
Experienced poster
Posts: 122
Joined: Tue Apr 16, 2002 10:07 am

Post by Zyaad Jaunnoo »

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... :oops:

yaro
New poster
Posts: 17
Joined: Sat Jan 03, 2004 3:18 pm
Location: Poland

Post by yaro »

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
New poster
Posts: 44
Joined: Fri Feb 20, 2004 5:52 pm

Post by Tomislav Novak »

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
Experienced poster
Posts: 122
Joined: Tue Apr 16, 2002 10:07 am

Post by Zyaad Jaunnoo »

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

Post Reply

Return to “Algorithms”