Discussion @ 1112. Cover @ Timus 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

Discussion of Problem 1112. Cover

How to solove this problem?

Posted by liuzhizhi 29 Jul 2006 09:57

Is greedy useful?
or I must use Dp.
Then How to Dp?

Re: How to solove this problem?

Posted by liuzhizhi 29 Jul 2006 20:19

I have solved it using Dp.
But is greedy useful?

Re: How to solove this problem?

Yes, the greedy is great. It's similar to the №1203 "Confernce".