[algogeeks] Re: Copying Books from Sphere online judge.

Tue, 10 Oct 2006 05:30:30 -0700

hi,
 
Giving a short thought...
I think an O(n^2) "greedy" solution will work.
 
Regards,
Prunthaban

 
On 10/10/06, Amal <[EMAIL PROTECTED]> wrote:

http://www.spoj.pl/problems/BOOKS1/

For this problem I have a Dp solution of O(n^3) and another solution based on Binary search.Is there a better DP (dynamic Programming ) soln of order less than n^3 .

Amal.


--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to