#include<bits/stdc++.h>
using namespace std;
#define int long long
#define N 200100
#define PII pair<int,int>

stack<PII>q;
stack<PII>h;
queue<PII>hh;
priority_queue<PII,vector<PII>,less<PII>>qq;
//priority_queue<PII,vector<PII>,greater<PII>>qqq;
int t;
int n;
int a[N];
int b[N];
int v[N];
int l,r,mid;
int maxn;
int ans;
int sss;


signed main()
{
    cin>>t;
    while(t--)
    {
        ans=0;
        cin>>n;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }
        a[n+1]=2e18;
        int i=1;
        while(i<=n)
        {
            while(i<=n&&a[i]>=a[i+1])
            {
                q.push({a[i],1});
                i++;
            }
            while(i<=n&&a[i]<=a[i+1])
            {
                h.push({a[i],1});
                i++;
            }
            if(h.size()==0)continue;
            //cout<<1<<endl;
            maxn=h.top().first;
            while(!h.empty())
            {
                qq.push(h.top());
                h.pop();
            }
            //cout<<maxn<<endl;
            while(!q.empty()&&q.top().first<=maxn)
            {
                qq.push(q.top());
                q.pop();
            }
            q.push(qq.top());
            sss=qq.top().first;
            qq.pop();
            //cout<<i<<endl;
            //cout<<q.top().first<<endl;

            while(!qq.empty())
            {
                //cout<<ans<<endl;
                //cout<<qq.top().first<<endl;
                if(qq.top().first!=sss)
                {
                    l++;
                }
                ans+=qq.top().second*l;
                q.top().second+=qq.top().second;
                sss=qq.top().first;
                qq.pop();
            }
        }
        //cout<<ans<<endl;
        //ans=0;
        hh.push(q.top());
        q.pop();
        while(!q.empty())
        {
            if(q.top().first==hh.front().first)
                hh.front().second+=q.top().second;
            else
                hh.push(q.top());
            q.pop();
        }
        while(!hh.empty())
        {
            ans+=hh.front().second*(hh.size()-1);
            hh.pop();
        }
        cout<<ans<<endl;

    }





    return 0;
}