SOLVE
LATER
You are given an array consisting of $$N$$ integers. Now, you need to find the length of largest sub array of this array where first element of this sub array is $$ \ge $$ than the last element of that sub array.
Let us consider a sub array from index $$i$$ to $$j$$. You need to find the length of the maximum length sub array, such that $$A[i] \ge A[j]$$.
Sample Input:
The first line contains a single integer $$T$$ denoting the number of test cases in a single test file. Each test case is spread over $$2$$ lines, in the following format :
The first line of each test case contains a single integer $$N$$ denoting the size of the given array $$A$$. The next line contains $$N$$ space separated integers, where the $$i^{th}$$ integer denotes $$A[i]$$.
Sample Output:
For each test case output answer in new line.
Constraints:
$$ 1 \le T \le 10 $$
$$ 1 \le N \le 10^5 $$
$$ -10^9 \le A[i] \le 10^9 $$
The max length sub array which can be chosen is from index 1 to 5.