#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=200005;

int t;
int skt1[N],skt2[N],ans1[N],ans2[N];
ll tt1,tt2,n,a[N],sum,num;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cin>>t;
    while(t--)
    {
        memset(ans1,0,sizeof ans1);
        memset(ans2,0,sizeof ans2);
        tt1=0,tt2=0,sum=0,num=0;
        cin>>n;
        for(int i=0;i<n;i++)
        {
            num=0;
            cin>>a[i];
            while(tt1&&skt1[tt1]<a[i])
            {
                num=ans1[tt1];
                ans1[tt1]=0;
                tt1--;
                ans1[tt1]+=num;
            }
            if(!tt1)
            {
                skt1[++tt1]=a[i];
                ans1[tt1]++;
                sum+=ans1[0];
                continue;
            }
            if(skt1[tt1]==a[i])
            {
                skt1[++tt1]=a[i];
                ans1[tt1]++;
                continue;
            }
            sum+=num;
            skt1[++tt1]=a[i];
            ans1[tt1]++;
        }
        for(int i=n-1;i>-1;i--)
        {
            num=0;
            while(tt2&&skt2[tt2]<a[i])
            {
                num=ans2[tt2];
                ans2[tt2]=0;
                tt2--;
                ans2[tt2]+=num;
            }
             if(!tt2)
             {
                 sum+=ans2[0];
                 skt2[++tt2]=a[i];
                 ans2[tt2]++;
                 continue;
             }
            sum+=num;
            skt2[++tt2]=a[i];
            ans2[tt2]++;
        }
        cout<<sum;
        if(t>0) cout<<endl;
        }
    return 0;
}