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

const ll maxn = (ll)2e5 + 7;
//求出左边第一个比他大的元素和右边第一个比他大的元素
ll a[maxn];
ll n;
void solve() {
    cin>>n;
    vector<ll> a(n + 2);
    a[0] = a[n + 1] = 2e9;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    ll ans = 0;
    //左边第一个绝对比他小的元素
    vector<ll> stk={ 0 };
    for (int i = 1; i <= n; i++) {
        while (!stk.empty() and a[stk.back()] <= a[i]) {
            stk.pop_back();
        }
        ans += i - stk.back() - 1;
        stk.push_back(i);
    }

    //右边第一个绝对比他小的元素
    stk = { n + 1 };
    for (int i = n; i >= 1; i--) {
        while (!stk.empty() and a[stk.back()] <= a[i]) {
            stk.pop_back();
        }
        if (a[stk.back()] != a[i]) ans += stk.back() - i - 1;
        stk.push_back(i);
    }

    cout << ans << '\n';
}

ll T;
int main() {
	cin >> T;
	while (T--) {
		solve();
	}
}