did u see the comment that nikhil made here<http://stackoverflow.com/questions/14545917/spoj-juice-extractor-wrong-ans> ?
On Thu, Feb 21, 2013 at 1:00 AM, marti <amritsa...@gmail.com> wrote: > ????????? ^^ > > > On Thursday, January 24, 2013 1:35:38 PM UTC+5:30, emmy wrote: > >> please help me with the following problem: >> http://www.spoj.com/problems/**JUICE/<http://www.spoj.com/problems/JUICE/> >> >> bit mask will require very large memory. >> If I sort the intervals in decreasing order of their start time.. I still >> cant make it to a dp >> If I sort the intervals in decreasing order of their finish times I am >> still not getting a recurrence for dp that is valid >> If I convert this to an interval graph, I have to find the maximum number >> of vertices that can be included in some clique of size >=3. But this also >> seems like a brute force approach. >> >> Which approach to try?? please help!! >> >> -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/groups/opt_out. > > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
