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

#define endl '\n'
#define ios ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)

#define int long long
typedef pair<int,int> pr;
#define pb(x) push_back(x)
#define all(a) a.begin(),a.end()
#define fi first
#define se second

const int N = 1e6+10;
string YES="YES",Yes="Yes",yes="yes",NO="NO",No="No",no="no";
const int mod=998244353,inf=1e15;
int dx[]={0,0,-1,0,1},dy[]={0,-1,0,1,0};

void solve()
{
    int n; 
    cin >> n;
    vector<int>a(n + 5, 0), mxr(n + 5, 0), sumr(n + 5, 0);
    for(int i = 1; i <= n; i ++){
        cin >> a[i];
    }
    stack<pr>st;
    // st.push({inf, n + 1});
    // for(int i = n; i >= 1; i --){
    //     while(st.size() && st.top().fi <= a[i]){
    //         st.pop();
    //     }
    //     mxr[i] = st.top().se;
    //     st.push({a[i], i});
    // }
    st.push({inf, n + 1});
    for(int i = n; i >= 1; i --){
        while(st.size() && st.top().fi < a[i]){
            st.pop();
        }
        sumr[i] = st.top().se;
        st.push({a[i], i});
    }
    // for(int i = 1; i <= n; i ++) cout << sumr[i] << ' '; cout << endl;

    int ans = 0;
    auto dfs = [&](auto&& dfs, int L, int l, int r) -> void{
        if(l == r) return ;
        int mid = sumr[l];
        if(mid <= r){
            dfs(dfs, L, l, mid - 1);
            if(a[mid] > a[l]){
                ans += (mid - L);
            }
            dfs(dfs, L, mid, r);
        }
        else{
            dfs(dfs, L + 1, l + 1, r);
            ans += (r - l);
        }
    };
    dfs(dfs, 1, 1, n);
    cout << ans << endl;
}

signed main()
{
    ios;
    int t=1;
    cin>>t;
    while(t--) solve();
    return 0;
}