Problem of the day
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
The first line of input contains an integer 'N', representing the size of the array.
The second line of input contains 'N' space-separated integers, representing the elements of the array.
The only output line contains one integer representing the length of the longest increasing subsequence.
You do not need to print anything; it has already been taken care of. Just implement the given functions.
1 <= N <= 10^5
-10^5 <= element <= 10^5
Time Limit: 1sec
6
5 4 11 1 16 8
3
Length of longest subsequence is 3 i.e. [5, 11, 16] or [4, 11, 16].
3
1 2 2
2