Given an array A of N positive integers. The task is to find the maximum of j - i subjected to the constraint of A[i] <= A[j].
The first line contains an integer T, depicting total number of test cases. Then T test case follows. First line of each test case contains an integer N denoting the size of the array. Next line contains N space separated integeres denoting the elements of the array.
Print the maximum difference of the indexes i and j in a separtate line.
1 ≤ T ≤ 1000
1 ≤ N ≤ 103
0 ≤ A[i] ≤ 1018
34 8 10 3 2 80 30 33 1
Testcase 1: In the given array A < A satisfying the required condition(A[i] <= A[j]) thus giving the maximum difference of j - i which is 6(7-1).
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.