#include<bits/stdc++.h>
#define int long long
#define mod 998244353
using namespace std;

int a[200006][2],ary[200006];
int l[200006],ne[200006];
set<int>s;
 signed main()
 {
    int t,n,sum,idex,allsum,head,last;
    cin>>t;
    while(t--)
    {
    	s.clear();
    	sum=0;
    	idex=1;
    	allsum=0;
    	cin>>n;
    	for(int i=1;i<=n;i++)
    	{
    		cin>>ary[i];
    		s.insert(ary[i]);
    		if(i!=1&&ary[i]!=ary[i-1])
    		{
    			a[idex][0]=ary[i-1];
    			a[idex][1]=sum;
    			sum=1;
    			idex++;
			}
			else
			{
				sum++;
			}
		}
			a[idex][0]=ary[n];
			a[idex][1]=sum;
			idex++;
			head=1;
			last=idex-1;
			for(int i=1;i<idex;i++)
			{
				ne[i]=i+1;
				l[i]=i-1;
			}
			for(auto it=s.begin();it!=s.end();it++)
			{
				it++;
				if(it==s.end())break;
				else it--;
				for(int i=head;i!=idex;i=ne[i])
				{
					if(*it==a[i][0])
					{
						allsum+=a[i][1];
						if(i==head)
						{
							l[ne[i]]=l[i];
							head=ne[i];
							a[ne[i]][1]+=a[i][1];
						}
						else if(i==last)
						{
							ne[l[i]]=ne[i];
							last=l[i];
							a[l[i]][1]+=a[i][1];
						}
						else
						{
							l[ne[i]]=l[i];
							ne[l[i]]=ne[i];
							if(a[l[i]][0]>a[ne[i]][0])
							{
								a[ne[i]][1]+=a[i][1];
							}
							else
							{
								a[l[i]][1]+=a[i][1];
							}
						}
					}
				}
			}
			cout<<allsum<<endl;
	}
    return 0;
 }