#include<bits/stdc++.h> 
#include<cstring>
#define int long long 

using namespace std;

const int N = 2e5+5;
int num[N], s[N], a[N];

void solve()
{
	int n; 
	cin>>n; 
	memset(num, 0, sizeof(num));
	memset(s, 0, sizeof(s)); 
	long long h=0, ans=0;
	for(int i=1; i<=n; ++i)
	{
		cin>>a[i];
		if(i==1){ h++, s[h]=a[i], num[h]=1; continue;}
		if(a[i]==s[h]) {num[h]++; continue;}
		if(a[i]<s[h]){
			s[++h]=a[i], num[h]=1; continue;
		}
		if(a[i]>s[h]){
			if(h==1||a[i]<s[h-1]){
				ans+=num[h], s[h]=a[i], num[h]++;
			}
			else if(a[i]==s[h-1]){
				ans+=num[h], num[h-1]+=num[h]+1, h--;
			}
			else ans+=num[h], num[h-1]+=num[h], s[h]=a[i], num[h]=1; 
		}
	}
	cout<<ans<<'\n';
}

signed main()
{
	//ios::sync_with_stdio(0); cin.tie(0);
	int T=1;
	cin>>T;
	while(T--)
		solve(); 
}