#include "bits/stdc++.h"

using namespace std;
using i64 = int64_t;
using ll = long long;
const int INF = 1e9;
struct node{
    int num;
    int id;
    bool operator < (const node&b)const{
        return num > b.num;
    }
};
void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 2);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }list<int> k{0};
    vector<list<int>::iterator> d(n + 2);
    d[0] = prev(k.end());

    vector<int> cnt(n + 2);
    for (int i = 1;i <= n;i++){

        cnt[i] = 1;
        k.push_back(i);d[i] = prev(k.end());
    }
    k.push_back(n + 1);d[n+1] = prev(k.end());
    priority_queue<node> pq;
    for (int i = 1; i <= n; i++) {
        pq.push({a[i], i});
    }
    ll ans = 0;
    while(!pq.empty()){
        node t = pq.top();
        pq.pop();
        int l = *prev(d[t.id]), r = *next(d[t.id]);
        if (l == 0 && r == n + 1)break;
        int mn = INF;
        int id;
        if (r != n + 1){
            mn = a[r];
            id = r;
        }
        if (l != 0 && a[l] < mn){
            mn = a[l];
            id = l;
        }
        cnt[id] += cnt[t.id];
        if (mn != t.num){ // hebing
            ans += cnt[t.id];
        }
      k.erase(d[t.id]);
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}