Yep.
It is Binary Search.
Greedy will not work :-(
My quick thuoght had dome flaws... :(
On 10/11/06, Arunachalam <[EMAIL PROTECTED]> wrote:
Can you please state your greedy solution?I have solved these kind of problems on the online judges using binary search. This problem is no exception to the binary search.regardsArunachalam.
On 10/10/06, Prunthaban Kanthakumar < [EMAIL PROTECTED]> wrote: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.
http"//ww.livejournal.com/users/arunachalam
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
- [algogeeks] Copying Books from Sphere online judge. Amal
- [algogeeks] Re: Copying Books from Sphere onli... Prunthaban Kanthakumar
- [algogeeks] Re: Copying Books from Sphere ... Arunachalam
- [algogeeks] Re: Copying Books from Sph... Prunthaban Kanthakumar
- [algogeeks] Re: Copying Books from... Rave Hanker
- [algogeeks] Re: Copying Books... ravi
- [algogeeks] Re: Copying B... Arunachalam
- [algogeeks] Re: Copying Books... Arunachalam
Reply via email to