#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> a(n + 2);
        a[0] = a[n + 1] = 2e9;
        for(int i = 1; i <= n; i++) cin >> a[i];
        LL ans = 0;
        {
            vector<int> 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;
                cout<<stk.back()<<endl;
                stk.push_back(i);
            }
        }
        {
            vector<int> 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';
    }

}