please answer this question with c++ code and cin the input not input test case

Description Given a permutation of length n, you need to find the sum of the minimum element of each contiguous subsequence. Formally, denote the array by A[1:n], you need to find l=1nr=lnmini=lrA[i]. It is guaranteed that A[i]=A[j] for all i=j, and 1A[i]n. Input The first line of the input contains an integer T, the number of test cases. Then T test cases follow. Each test case contains two lines. The first line contains an integer n, the length of the array. The second line contains n integers, the elements of the array. Output For each test case, output a single line containing the answer as required above. Sample Input/Output Input 1 5 14235 Output 32 Constraint 1n105,1A[i]n.i=j,A[i]=A[j]