↵
I've been stuck at this problem for the past 2 days. I came at a DP recurrence DP(i) = 1+DP(i+1)+DP(nextPossibleInterval(i)), where DP(i) represents all possible subsets of classes b/w ith and nth interval(sorted by endTime).↵
↵
IM
Thanks!↵
↵
[My Code
↵
Spoj submission ID: 22172501
↵
[Problem](https://www.spoj.com/problems/ACTIV/)↵
↵
Sample test case:↵
↵
8↵
4 9↵
1 15↵
2 18↵
4 5↵
7 19↵
14 25↵
19 20↵
3 26↵
-1 Expected Output: 00000017; Actual Output: 00000026