Problem of the day
Input: βNβ = 4, βHILLSβ = [3, 2, 1, 3]
Output: 5
If we consider the indices from 0 to 3 then the pairs are (0, 1), (0,3), (1, 2), (1,3), and (2, 3).
The soldier at hill 0 can not see hill 2 as hill[1]>hill[2].
The first line will contain the integer 'T', denoting the number of test cases.
The next line contains a single integer βNβ representing the number of hills.
The next line contains βNβ integers denoting the height of hills.
For each test case print the number of pairs of soldiers who can see the torch of each otherβs hills.
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^5
1 <= HILLS[i] <= 10^9
Time Limit: 1 sec
2
4
3 2 1 3
5
1 2 3 4 5
5
4
For the first test case:-
If we consider the indices from 0 to 3 then the pairs are (0, 1), (0,3), (1, 2), (1,3), and (2, 3).
The soldier at hill 0 can not see hill 2 as hill[1]>hill[2].
For the second test case:-
Only consecutive hill soldiers can see each other for others there is a higher hill in between them.
2
5
3 2 1 3 5
6
2 2 1 3 4 6
7
7