#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
using ll =long long;
const int N=2e5+10;
const int mod=19260817;
const int p=1e9+7;
const int inf =0x3f3f3f3f;
const double PI=3.141592;
typedef pair<ll,ll> PII;
typedef vector<ll> vc;
int dx[]={-1,1,0,0},dy[]={0,0,-1,1};
ll fac[N],finv[N],inv[N];
void init()
{
    fac[1]=fac[0]=finv[0]=finv[1]=inv[0]=inv[1]=1;
    for(int i=2;i<N;i++)
    {
        fac[i]=fac[i-1]*i%p;
        inv[i]=(p-p/i*inv[p%i]%p)%p;
        finv[i]=finv[i-1]*inv[i]%p;
    }
}
ll C(ll a,ll b)
{
    if(a<b)
    {
        return 0;
    }
    if(b<0)
    {
        return 0;
    }
    return fac[a]*finv[b]%p+finv[a-b]%p;
}
ll n;
ll a[N];
void solve()
{
    cin>>n;
    map<ll,ll>mp;
    stack<ll>st;
    ll mx=0;
    ll res=0;
    for(int i=1;i<=n;i++) 
    {   cin>>a[i];
        mx=max(mx,a[i]);
    }
    a[n+1]=mx;
    st.push(a[1]);
    mp[a[1]]++;
    for(int i=2;i<=n+1;)
    {
        if(a[i]==st.top()) {mp[a[i]]++;i++;}
        while((st.size()&&a[i]<st.top()))
        {
            st.push(a[i]);
            mp[a[i]]++;
            i++;
        }
        while(a[i]>st.top())
        {
            mp[a[i]]++;
            ll x=st.top();
            st.pop();
            if(st.size()&&st.top()<=a[i])
            {
                res+=mp[x];
                mp[st.top()]+=mp[x];
                mp[x]=0;
            }
            else
            {
//                cout<<2<<":"<<mp[2]<<endl;
                res+=mp[x];
                st.push(a[i]);
                mp[a[i]]+=mp[x];
//                cout<<endl<<a[i]<<" "<<mp[a[i]]<<endl;
                mp[x]=0;
                i++;
                break;
            }
        }
    }
    mp[mx]=0;
    cout<<res<<endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int _=1;
    cin>>_;
    while(_--)
    {
        solve();
    }
}