in c++ and use

1. #include
2. onely

A sub-array of array is an array composed from a contiguous block of the original array's elements. In other words A sub-array A[ij], where (1ijN), is a sequence of integers Aj,Ai+1,,Aj. For Example : IF array =[1,6,3,7] then the subarrays are [1],[6],[3],[7],[1,6],[6,3],[3,7],[1,6,3],[6,3,7],[1,6,3,7]. Something like [1,3] would not be a sub-array as it's not a contiguous subsection of the original array. Given a number N and an array A of N numbers. Print the number of sub-arrays which are non-decreasing. Note: - A sub-array A[ij] is non-decreasing if (AiAi+1Ai+2Aj. Input First line contains a number T(1T5) number of test cases, Each test case contains two lines: - First line contains a number N(1N102) mamber of elements. - Second line contains N numbers (105Ai105) Output For each test case print a single line contains the number of sub-arrays which are non-decreasing.. Note First example: All valid sub-arrays are