Given an array of N positive integers a1, a2 ............ an. The value of each contiguous subarray of given array is the maximum element present in that subarray. The task is to return the number of subarrays having value strictly greater than K.
The first line of the input contains 'T' denoting the total number of testcases. Then follows the description of testcases. The first line of each testcase contains two space separated positive integers N and K denoting the size of array and the value of K. The second line contains N space separated positive integers denoting the elements of array.
Output the number of subarrays having value strictly greater than K.
1 <= T <= 50
1 <= N <= 100
1 <= a[i] <= 105
3 2 1
1 2 3 4
Testcase 1: The subarrays having value strictly greater than K are: , [3, 2] and [3, 2, 1]. Thus there are 3 such subarrays.
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.