Longest Increasing Subsequence
Print the length of the longest strictly increasing subsequence.
Input: the first line has N; the second line has N integers.
Output: the LIS length.
Constraints:
- 1 ≤ N ≤ 105
- −109 ≤ ai ≤ 109
Sample Tests
Input 1
6 5 2 8 6 3 6
Output 1
3
Input 2
4 4 3 2 1
Output 2
1
Discussion (opens after you solve — no spoilers before)
No comments yet.