ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1303. Minimal Coverage

Easy dp
Posted by Elisabeth 19 Sep 2009 16:41
I can't make greedy solution, but I AC-ed this problem with simple dp solution. Can you tell me greedy solution?
Re: Easy dp
Posted by Igor9669(Tashkent IAC) 1 Nov 2009 11:14
Just sort it!
Re: Easy dp
Posted by al amin hosain 27 Aug 2011 02:41
hello Elisabeth...I solved this problem with greedy approach in uva site..but I cant figure out dp approach...can you help me to figure out dp recurrences in this and some other problems...I am curious...