please help me with the following problem: 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!! --
