#include <bits/stdc++.h>
using namespace std;
int t,n,a[200005],ans;
void solve(int l,int r){
	if (r-l+1<=2){
		if (a[l]!=a[r]) ans++;
		return ;
	}
	else if(r-l+1==3){
		if((a[l]==a[l+1])&&(a[l+1]==a[r]))return;
		else if((a[l]==a[r]&&a[l+1]<a[l])||(a[l]==a[l+1]&&a[r]<a[l])||(a[l+1]==a[r]&&a[l]<a[r]))ans++;
		else if(a[l]!=a[l+1]&&a[l+1]!=a[r]&&a[l]!=a[r])ans+=3;
		else ans+=2;
		return;
	}
	int maxx=0,p=0,cnt=0;
	for (int i=l;i<=r;i++){
		if (maxx<a[i]) maxx=a[i],p=i,cnt=1;
		else if(maxx==a[i])cnt++;
	}
	if (p>l) solve(l,p-1);
	if (p<r) solve(p+1,r);
	ans+=r-l;
	if (cnt>1) ans-=r-p;
}
int main (){
	cin>>t;
	while(t--){
		ans=0;
		cin>>n;
		for (int i=1;i<=n;i++) cin>>a[i];
		solve(1,n);
		cout<<ans<<endl;
	}
	return 0;
}