Longest Decreasing Subsequence
There can be more than one subsequences with the longest length.
For the given array [5, 0, 3, 2, 9], the longest decreasing subsequence is of length 3, i.e. [5, 3, 2]
Try to solve the problem in O(N log N) time complexity.
The first line of input contains an integer 'T' representing the number of the test case. Then the test case follows. The first line of each test case contains an integer ‘N’ representing the size of the array/list. The second line of each test case contains N single space-separated integers representing the array/list elements.
For each test case, print the integer denoting the length of the longest decreasing subsequence. Print the output of each test case in a separate line.
You do not need to print anything; it has already been taken care of. Just implement the given function.
1 <= T <= 50 1 <= N <= 5000 1 <= ARR[i] <= 10^9 Time Limit: 1 sec