#include "bits/stdc++.h"
using namespace std;
#define int long long
const int Len = 2e5 + 5 , Inf = 1e9 + 1;
int n,a[Len],ans;
struct node
{
	int idx,val,fa,ch[2],siz;
	node(){siz = idx = 0 , val = 0 , fa = 0 , ch[0] = ch[1] = 0;}
	node(int IDX,int VAL,int FA,int SIZ){siz = SIZ , idx = IDX , val = VAL , fa = FA , ch[0] = ch[1] = 0;}
}p[Len];
int Init()
{
	for(int i = 1 ; i <= n ; i ++)
	{
		int P = i - 1;
		while(p[P].val < p[i].val) P = p[P].fa;
		p[i].ch[0] = p[P].ch[1];
		p[P].ch[1] = i;
		p[i].fa = P;
		p[p[i].ch[0]].fa = i;
	}
	return p[0].ch[1];
}
void dfs(int u)
{
	if(!u) return;
	//printf("%d %d %d %d\n",u,p[u].idx,p[p[u].ch[0]].idx,p[p[u].ch[1]].idx); 
	p[u].siz = 1;
	dfs(p[u].ch[0]) , dfs(p[u].ch[1]);
	p[u].siz += p[p[u].ch[0]].siz + p[p[u].ch[1]].siz;
	if(p[u].val != p[p[u].ch[0]].val) ans += p[p[u].ch[0]].siz;
	if(p[u].val != p[p[u].ch[1]].val) ans += p[p[u].ch[1]].siz;
}
inline int read() {
    char ch = getchar();
    int x = 0, f = 1;
    while (ch < '0' || ch > '9') {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while ('0' <= ch && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}
inline void write(int x) {
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}
signed main()
{
	int T;T = read();
	while(T --)
	{
		p[0] = node(0 , Inf , 0 , 0);
		n = read();ans = 0;
		if(n == 1)
		{
			puts("0");
			continue;
		}
		for(int i = 1 ; i <= n ; i ++) 
		{
			a[i] = read();
			p[i] = node(i , a[i] , 0 , 0);
		}
		int rt = Init();
		dfs(rt);
		printf("%lld\n",ans);
	}
	return 0;
}