#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

typedef double ff;
typedef long long int ll;
typedef unsigned long long int ull;
using namespace std;

typedef pair<ll, ll> pii;

const int N = 2e5 + 10, M = 1e7, mod = 998244353;

int n, a[N], pos[N];
ll f[N];

int dfs(int u)
{
	if(f[u] != -1) return f[u];
	else {
		return dfs(pos[u]) + 1;
	}
}

void solve()
{
	cin >> n;
	
	for(int i = 1; i <= n; i ++ ) cin >> a[i], f[i] = pos[i] = -1;
	
	stack<int> stk;
	for(int i = 1; i <= n; i ++ ) {
		while(stk.size() && a[i] >= a[stk.top()]) stk.pop();
		if(stk.size()) pos[i] = stk.top();
		else pos[i] = -1;
		stk.push(i);
	}
	
	
	
	while(stk.size()) stk.pop();
	for(int i = n; i >= 1; i -- ) {
		while(stk.size() && a[i] >= a[stk.top()]) stk.pop();
		if(stk.size()) {
			int head = stk.top();
			if(pos[i] == -1) pos[i] = head;
			else {
				if(i - pos[i] == head - i) {
					if(a[head] < a[pos[i]]) pos[i] = head;
				} else {
					if(head - i < i - pos[i]) pos[i] = head;
 				}
			}
		} else pos[i] = max(pos[i], -1);
		stk.push(i);
	}
	
	// for(int i = 1; i <= n; i ++ ) {
		// cout << pos[i] << ' ';
	// }
	// cout << '\n';
	for(int i = 1; i <= n; i ++ ) {
		if(pos[i] == -1) f[i] = 0;
	}
	
	for(int i = 1; i <= n; i ++ ) {
		if(f[i] != -1) continue;
		f[i] = dfs(pos[i]) + 1;
	}
	
	ll ans = 0;
	for(int i = 1; i <= n; i ++ ) {
		ans += f[i];
		// cout << f[i] << ' ';
	}
	cout << ans << '\n';
}

int main()
{
	fastio;
	
	int t = 1;
	cin >> t;

	while( t -- ) solve();
}