You are given an array of N positive integers, A1, A2 ,…, AN.
Let’s denote by A[i, j] the subarray Ai, Ai+1 ,…, Aj.
Count pairs (i, j) such that 1 ≤ i ≤ j ≤ N and subarray A[i, j] is increasing. Return the value modulo 109 + 7.
A=[4, 5, 1, 2] All subarrays of size 1 are increasing. Subarrays A[1, 2], A[3, 4] of size 2 are increasing. No subarray of size 3 and 4 is increasing. So, total of 6 subarrays are increasing.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.