LISNumberDivTwo.cpp

struct LISNumberDivTwo {
  int calculate(vector <int> seq) {
		int i, j, ans = 0, N = seq.size();
		
		for (i = 0; i < N; i++) {
			j = i + 1;
			priority_queue<int> q; q.push(seq[i]);
			while (j < N && seq[j] > q.top()) {
				q.push(seq[j]); j += 1;
			}
			ans += 1;
			i = j - 1;
		}		
		
		return ans;
	}
};