#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e6 + 10;

void solve()
{
	int n, ans = 0;
	cin >> n;
	
	vector <int> a (n);
	for (auto & i : a) {
		cin >> i;
	}
	
	vector<vector<int>> st (log2(n) + 1, vector<int> (n));
	iota (st[0].begin(), st[0].end(), 0);
	
	auto calc = [&] (int u, int v) {
		if (a[u] == a[v]) {
			return u < v ? u : v; 
		}
		return a[u] > a[v] ? u : v;
	};
	
	for (int j = 1; (1 << j) <= n; ++ j) {
		for (int i = 0; i + (1 << j) - 1 < n; ++ i) {
			st[j][i] = calc(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
		}
	}
	
	auto query = [&] (int l, int r) {
		int k = log2(r - l + 1);
		return calc(st[k][l], st[k][r - (1 << k) + 1]);
	};
	
	auto dfs = [&] (auto &dfs, int l, int r) -> void {
		if (l >= r) {
			return;
		}
		int mid = query (l, r);
		dfs (dfs, l, mid - 1);
		dfs (dfs, mid + 1, r);
		if (l <= mid - 1 && a[query(l, mid - 1)] < a[mid]) {
			ans += mid - l;
		}
		if (r >= mid + 1 && a[query(mid + 1, r)] < a[mid]) {
			ans += r - mid;
		}
	};
	
	dfs (dfs, 0, n - 1);
	cout << ans << endl;
}

signed main() 
{
    int T;
    cin >> T;
    while (T --) {
    	solve();
	}
    return 0;
}