#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
const ll M=0x7fffffff;

inline ll read(){
    char c=getchar();ll _x=0, f=1;
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) _x=_x*10+c-'0';
    return _x*f;
}

ll t, n, m, head, ed_ans, t_max=0;
ll find_fir[N];
struct node{
	ll num, ans, rig_ip, lef_ip;
}a[N];

struct nod{
	ll num, ip;
	
	bool operator <(const nod &x)const//��������ʽ 
	{
		return x.num > num; 
	}
}b[N];

priority_queue<nod> q;

bool cmp(node x, node y){
	return x.num>y.num;
}

int main(){
	t=read();
	
	while( t-- ){
		ed_ans=0, t_max=0;
		n=read();
		for(int i=1;i<=n;i++) a[i].num=read(), b[i].num=a[i].num, b[i].ip=i, t_max=max(t_max, a[i].num), a[i].ans=0;
		
		for(int i=n;i>=1;i--){
			while( head && a[ find_fir[head] ].num <= a[i].num ) head--;
			a[i].rig_ip = find_fir[head];
			find_fir[ ++head ] = i;
		}
		
		head=0;
		for(int i=1;i<=n;i++){
			while( head && a[ find_fir[head] ].num <= a[i].num ) head--;
			a[i].lef_ip = find_fir[head];
			find_fir[ ++head ] = i;
		}
		
		for(int i=1;i<=n;i++)	q.push( b[i] );
		
		while( !q.empty() ){
			nod the_big=q.top(); q.pop();
			
			if( t_max == the_big.num ) continue;
			
			a[ the_big.ip ].ans = max(a[ a[ the_big.ip ].rig_ip ].ans, a[ a[ the_big.ip ].lef_ip ].ans) + 1;
			ed_ans += a[ the_big.ip ].ans;
		}
		
		printf("%lld\n", ed_ans);
	}
	
    return 0;
}