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

inline int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') f = -1; c = getchar(); }
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}

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

    int t = read();
    while (t--) {
        int n = read();
        vector<int> dp(n + 1);
        stack<int> kp1, kp2;
        vector<int> mp1(n + 1, n + 1);
        vector<int> mp2(n + 1, 0);

        for (int i = 1; i <= n; i++) {
            dp[i] = read();
        }

        for (int i = 1; i <= n; i++) {
            while (!kp1.empty() && dp[kp1.top()] <= dp[i]) {
                mp1[kp1.top()] = i;
                kp1.pop();
            }
            kp1.push(i);
        }

        for (int i = n; i >= 1; i--) {
            while (!kp2.empty() && dp[kp2.top()] <= dp[i]) {
                mp2[kp2.top()] = i;
                kp2.pop();
            }
            kp2.push(i);
        }

        int op = 0;
        for (int i = 1; i <= n; i++) {
            int x = mp1[i], y = mp2[i];
            if (x <= n && dp[x] != dp[i]) {
                op += (mp1[i] - i - 1);
            }
            op += (i - mp2[i] - 1);
        }

        printf("%lld\n", op);
    }

    return 0;
}