#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
typedef long long ll;
#define pll pair<ll,ll>
const int inf=0x3f3f3f3f;
const int N=2e5+5;
const int mod=99844854;
#define PI 3.1415926
#define fi first
#define se second
struct st{
	ll l,r,ma,len;
};
ll n,a[N],ans;
st x;
void check(){
	while(x.r<=n){
		if(x.l==1){
			if(x.r==n)return;
			if(x.ma<a[x.r+1]){
				ans+=x.len;
				x.r++;
				x.ma=a[x.r];
				x.len++;
			}
			else if(x.ma==a[x.r+1]){
				x.r++;
				x.len++;
			}
			else{
				st p=x;
				x.r++;
				x.l=x.r;
				x.ma=a[x.r];
				x.len=1;
				check();
				x.l=p.l;x.ma=p.ma;
				x.len=x.r-x.l+1;
			}
		}
		else{
			if(x.r==n){
				ans+=x.len;
				return;
			}
			else{
				if(x.ma==a[x.r+1]){
					x.r++;
					x.len++;
				}
				else if(x.ma>a[x.r+1]){
					st p=x;
					x.r++;
					x.l=x.r;
					x.ma=a[x.r];
					x.len=1;
					check();
					x.l=p.l;x.ma=p.ma;
					x.len=x.r-x.l+1;
				}
				else{
					if(a[x.r+1]==a[x.l-1]){
						x.r++;
					}
					else if(a[x.r+1]>a[x.l-1]){
						ans+=x.len;
						a[x.r]=a[x.l-1];
						return;
					}
					else{
						ans+=x.len;
						x.r++;x.ma=a[x.r];
						x.len=x.r-x.l+1;
					}
				}
			}
		}
	}
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;++i)cin>>a[i];
	ans=0;
	x={1,1,a[1],1};
	check();
	cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;cin>>t;
    while(t--){
    	solve();
	}
    return 0;
}