Problem definition:
Find out a set of contiguous subsequences from a sequence maximizing the total cardinality of subsequences such that the total elements bigger than T1 in subsequences, doesn't exceed T2.
Click here to view the mathematical description of the problem.

Application of the problem:

Approach to solution:
Click here to view the solution approach of the problem.