// بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ
// In the Name of Allah, the Beneficent, the Merciful.
#include <bits/stdc++.h>
using namespace std;
// using namespace __gnu_pbds;
// template <typename T> 
// using o_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define vi vector<int>
#define vl vector<long long>
#define vecp vector<pair<int, int>> 
#define ll long long
#define ull unsigned long long
#define F first
#define S second
#define pii pair<int, int>
#define inv(a) for(auto &it : a) cin >> it;
#define outv(a) for(auto &it : a) cout << it << " "; cout << "\n"
#define outv1(a) for(auto &it : a) cout << it << endl
#define pb push_back
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define inf 1e18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long


void solve(int tc) {
    int n;
    cin>>n;
    vl v(n);
    inv(v);
    stack<int> s;
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        while(!s.empty() && v[s.top()]<v[i]) s.pop();
        if(s.empty()) ans+=i;
        else {
            if(v[s.top()]>v[i])
                ans+=i-s.top();
        }
        s.push(i);
    }
    reverse(all(v));
    while(!s.empty()) s.pop();
    int ans1 = 0;
    for (int i = 0; i < n; i++)
    {
        while(!s.empty() && v[s.top()]<v[i]) s.pop();
        if(s.empty()) ans1+=i;
        else {
            if(v[s.top()]>v[i])
                ans1+=i-s.top();
        }
        s.push(i);
    }
    cout<<max(ans1, ans)<<endl;
    
}

int32_t main() { 
     
    fastio;
    // #ifndef ONLINE_JUDGE
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    // #endif
 
    
    int Tc=1;
    cin>>Tc;
    for (int T = 1; T <= Tc; T++)
    {
        solve(T);
    }
    
    
    return 0;
}