#include<bits/stdc++.h>
#define  int long long
#define fi first
#define se second
using namespace std;
typedef pair<int,int> PII;
const int N=2e5+10;
int a[N],b[N],c[N];
map<int,vector<int>>q;
signed main(){
	int t;cin>>t;
	while(t--){
		int n,ma=0,k=0;cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
			if(i==1)b[++k]=a[i],c[k]++;
			else if(a[i]==b[k])c[k]++;
			else b[++k]=a[i],c[k]++;
		}
		set<int>se;
		for(int i=1;i<=k;i++)q[b[i]].push_back(i),ma=max(ma,b[i]),se.insert(i);
		int ans=0;
		for(auto [u,v]:q){
			if(u==ma)break;
			int k=0;
			for(int i=0;i<v.size();i++){
				if(v[i]!=1&&v[i]!=n){
					se.erase(se.find(v[i]));
					int x=*se.lower_bound(v[i]);
					int y=*(--se.lower_bound(v[i]));
					if(b[x]<b[y])ans+=c[v[i]],c[x]+=c[v[i]];
					else ans+=c[v[i]],c[y]+=c[v[i]];
				}else if(v[i]==1){
					se.erase(se.find(v[i]));
					int x=*se.lower_bound(v[i]);
					ans+=c[1],c[x]+=c[1];
				}else {
					se.erase(se.find(v[i]));
					int y=*(--se.lower_bound(v[i]));
					ans+=c[n],c[y]+=c[n];
				}
				//cout<<ans<<'\n';
			}
			//cout<<ans<<'\n';
		}
		//for(int i=1;i<=k;i++)cout<<c[i]<<' ';
		if(t!=0)
		cout<<ans<<'\n';
		else cout<<ans;
		memset(c,0,sizeof c);
		q.clear();
	}
	return 0;	
}