#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define ull unsigned long long
#define MAXN 200009
#define Inf 2147483647
int a[MAXN];
ll f[MAXN];
void solve() {
	int n, maxx = 0;
	ll ans = 0;
	cin >> n;
	memset(f,0,sizeof(f));
	for(int i = 1; i <= n; i++)
		cin >> a[i], maxx = max(maxx, a[i]);
	for(int i = 1; i <= n; i++){
		if(a[i] == maxx)
			continue;
		int l = i - 1, r = i + 1, maxl = 0, maxr = n + 1, minx = 0;
		while(l >= 1 && a[l--] > a[i]){ 
			maxl = l + 1;
			break;
		}	
		while(r <= n && a[r++] > a[i]) {
			maxr = r - 1;
			break;
		}
		if(maxl && maxr != n+1) 
			minx = a[maxl] > a[maxr] ? maxr : maxl;
		else if(!maxl) 
			minx = maxr;
		else if(maxr != n + 1)
			minx = maxl;
		f[minx] = f[i] + 1;
		ans += f[minx];
	}
	
	cout << ans << endl;
	
}
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int t=1;
	cin>>t;
	while (t--)
		solve();
	return 0;
}