#include<bits/stdc++.h>
using namespace std;
/*
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
*/
typedef long long LL;
#define int long long
#define ld long double
//#define INT __int128
#define fi first
#define se second
const LL INF = 0x3f3f3f3f3f3f3f3f;
typedef unsigned long long ULL;
typedef pair<long long, long long> PLL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const int inf = 0x3f3f3f3f;
const LL mod = 998244353;
const ld eps = 1e-12;
const int N = 2e5 + 10, M = 2e5 + 5, K = 55;
int n;
int a[N],ans[N];

void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	deque<int>q;
	for(int i=1;i<=n;i++){
		while(q.size()&&a[q.back()]<=a[i])q.pop_back();
		ans[i]=q.size();
		q.push_back(i);
	}
	q.clear();
	for(int i=n;i>0;i--){
		while(q.size()&&a[q.back()]<=a[i])q.pop_back();
		ans[i]=q.size();
		q.push_back(i);
	}
	int ret=0;
	for(int i=1;i<=n;i++){
		ret+=ans[i];
	}
	cout<<ret<<endl;
}

signed main() {
	// ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	int T = 1,cas=0;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}

/*



*/