30

Maximum Distance

Difficulty: MEDIUM
Contributed By
Sounak Majumder
Avg. time to solve
15 min
Success Rate
80%

Problem Statement
Suggest Edit

You have been given an array 'A' of integers. You need to find the maximum value of j - i subjected to the constraint of A[i] <= A[j], where ‘i’ and ‘j’ are the indices of the array.

For example :
If 'A' = {3, 5, 4, 1}

then the output will be 2.
Maximum value occurs for the pair (3, 4)
Input Format:
The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases are as follows.

The first line of each test case contains an integer ‘N’ which denotes the size of the array.

The second line of each test case contains elements of the array. The line consists of values of elements of the array separated by a single space.
Output Format:
For each test case, print a single line containing a single integer denoting the maximum value of j - i subjected to the condition A[i] <= A[j].

The output of each test case will be printed in a separate line.

Note:

You don’t have to print anything; it has already been taken care of. Just implement the given function. 
Constraints:
1 <= T <= 100
1 <= N <= 10 ^ 4
-10 ^ 5 <= DATA <= 10 ^ 5


Where ‘T’ is the number of test cases, ‘N’ is the size of the array, “DATA” is the value of the element of the array.

Time limit: 1 sec.
Sample Input 1:
1
9
34 8 10 3 2 80 30 33 1
Sample Output 1:
6
Explanation:
Maximum value occurs for the pair (8, 33)
Sample Input 2:
1
10
9 2 3 4 5 6 7 8 18 0
Sample Output 2:
8
Explanation:
Maximum value occurs for the pair (9, 18)
Reset Code
Full screen
copy-code
Console