// ֻѡÔñΪ2µÄÇø¼ä
// Ñ¡ÔñÏàÁÚ½ÏСµÄÒ»¶¨±ÈÑ¡´óµÄ¸üÓÅ
#include <bits/stdc++.h>

#define x first
#define y second

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;

int n, m;
int w[N];
int mount[N], sum[N], cnt;
PII wg[N];
map<int, int> alp;
set<int> nums;

inline void read(int& a)
{
	int s = 0, w = 1;
	char ch = getchar();
	while (ch < '0' || ch>'9')
	{
		if (ch == '-')
			w = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9')
	{
		s = s * 10 + ch - '0';
		ch = getchar();
	}
	a = s * w;
}

int main()
{
	int T;
	read(T);
	while (T -- )
	{
		read(n);
		
		m = 0;
		for (int i = 1; i <= n; ++ i)
		{
			read(w[i]);
			if (i == 1 || w[i] != w[i - 1]) wg[++ m] = {w[i], 1};
			else wg[m].y ++;
		}
		
		for (int i = 1; i <= m; ++ i)
			sum[i] = sum[i - 1] + wg[i].y;
		
		cnt = 0;
		mount[++ cnt] = 1;
		for (int i = 2; i < m; ++ i)
			if (wg[i].x > wg[i - 1].x && wg[i].x > wg[i + 1].x) 
				mount[++ cnt] = i;
		mount[++ cnt] = m;

		int res = 0;
		nums.clear();
		for (int i = 1; i < cnt; ++ i)
		{
			int len = 0;
			int j = i + 1;
			for (int k = mount[i]; k <= mount[j]; ++ k)
			{
				nums.insert(wg[k].x);
				if (alp[wg[k].x] == 0) len ++;
				alp[wg[k].x] += wg[k].y;
			}
			
			int tmp;
			int now = 1;
			for (auto it = nums.begin(); it != nums.end(); ++ it)
			{
				tmp = *it;
				res = res + (LL)alp[tmp] * (len - now);
				alp[tmp] = 0;
				++ now;
			}
			
			wg[mount[j]].x = tmp, wg[mount[j]].y = sum[mount[j]];
		}
		
		printf("%d\n", res);
	}
	
	return 0;
}