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

const int maxn=2e5+10;
int t,n,m;
int a[maxn],b[maxn],c[maxn],fa[maxn],sz[maxn],pre[maxn],nxt[maxn];
vector<int>e[maxn];
inline void ipt(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		b[i]=a[i];
	}
}
inline void init(){
	sort(b+1,b+n+1);
	m=unique(b+1,b+n+1)-b-1;
	for(int i=1;i<=n;i++){
		c[i]=lower_bound(b+1,b+n+1,a[i])-b;
		e[c[i]].push_back(i);
//		printf("%lld ",c[i]);
	}
//	printf("\n");
}
inline int find(int x){
	if(fa[x]==x)return x;
	return fa[x]=find(fa[x]);
}
inline void solve(){
	int ans=0;
	for(int i=1;i<=n;i++)fa[i]=i,sz[i]=1;
	fa[0]=0,fa[n+1]=0;
	for(int i=1;i<=n;i++)pre[i]=i-1,nxt[i]=i+1;
	for(int i=1;i<=m;i++){
		for(int j=0;j<e[i].size();j++){
			int u=e[i][j];
			u=find(u);
			int v1=pre[u],v2=nxt[u];
			v1=find(v1);
			v2=find(v2);
			if(c[v1]==c[v2]){
				if(c[u]<c[v1]){
					fa[u]=v1;
					nxt[v1]=v2;
					ans+=sz[u];
					sz[v1]+=sz[u];
				}
				else if(c[u]==c[v1]){
					fa[u]=v1;
					nxt[v1]=v2;
					sz[v1]+=sz[u];
				}
			}
			else if(c[v1]>c[v2]){
				if(c[u]<c[v2]){
					fa[u]=v2;
					pre[v2]=v1;
					ans+=sz[u];
					sz[v2]+=sz[u];
				}
				else if(c[u]==c[v2]){
					fa[u]=v2;
					pre[v2]=v1;
					sz[v2]+=sz[u];
				}
				else if(c[u]<c[v1]){
					fa[u]=v1;
					nxt[v1]=v2;
					ans+=sz[u];
					sz[v1]+=sz[u];
				}
				else if(c[u]==c[v1]){
					fa[u]=v1;
					nxt[v1]=v2;
					sz[v1]+=sz[u];
				}
			}
			else {
				if(c[u]<c[v1]){
					fa[u]=v1;
					nxt[v1]=v2;
					ans+=sz[u];
					sz[v1]+=sz[u];
				}
				else if(c[u]==c[v1]){
					fa[u]=v1;
					nxt[v1]=v2;
					sz[v1]+=sz[u];
				}
				else if(c[u]<c[v2]){
					fa[u]=v2;
					pre[v2]=v1;
					ans+=sz[u];
					sz[v2]+=sz[u];
				}
				else if(c[u]==c[v2]){
					fa[u]=v2;
					pre[v2]=v1;
					sz[v2]+=sz[u];
				}
			}
//			for(int k=1;k<=n;k++)printf("%lld ",fa[k]);
//			printf("\n");
		}
		e[i].clear();
	}
	printf("%lld\n",ans);
}
signed main(){
	scanf("%lld",&t);
	while(t--){
		ipt();
		init();
		solve();
	}
	return 0;
}