#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define debugging 1
const int maxn = 200010;
#define pii pair<int, int>
#define f first
#define s second

int n;
int a[maxn];
int l[maxn], r[maxn];

void solve() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
	}
	a[0] = a[n+1] = 1000000001;
	stack<int> st;
	st.push(0);
	for (int i = 1; i <= n + 1; ++i) {
		while (a[st.top()] < a[i]) {
			r[st.top()] = i - 1;
			st.pop();
		}
		l[i] = st.top() + 1;
		st.push(i);
	}
	
	while (!st.empty()) st.pop();
	st.push(n + 1);
	for (int i = n; i >= 0; --i) {
		while (a[st.top()] < a[i]) {
			st.pop();
		}
		r[i] = st.top() - 1;
		st.push(i);
	}
	
	for (int i = 1; i < n; ++i) {
		if (a[i] == a[i+1]) {
			r[i] = i;
		}
	}

//	for (int i = 1; i <= n; ++i) {
//		printf("%d: [%d, %d]\n", i, l[i], r[i]);
//	}
	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
		ans += r[i] - l[i];
	}
	printf("%lld\n", ans);
}
/*
4
2
1 2
2
2 2
7
1 1 1 2 2 2 2
3
1 2 3


*/

int main() {
    int tt = 1;
//    cin >> tt;
    scanf("%d", &tt);
    while (tt--) {
        solve();
    }
    
    return 0;
}
/*


*/