#include <bits/stdc++.h>

using namespace std;

#define dbg(x) cout << #x << " = " << x << "\n";
#define jiasu ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long LL;
typedef pair<LL, LL> PLL;

const LL N = 1e6 + 1;
const LL M = 2020;
const LL mod = 1e9 + 7;

LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }
LL lcm(LL a, LL b) { return a * b / gcd(a, b); }

LL qsm(LL a, LL b, LL m)
{
    LL w = 1;
    a %= m;
    while (b)
    {
        if (b & 1) w = (w * a) % m;
        a = a * a % m;
        b >>= 1;
    }
    return w;
}

LL A(LL n, LL m)
{
    LL w = 1;
    while (m--)
    {
        w = w * n;
        n -= 1;
    }
    return w;
}

LL C(LL n, LL m)
{
    LL w = 1;
    m = min(m, n - m);
    for (LL i = 1; i <= m; ++i)
    {
        w = w * (n - m + i) / i;
    }
    return w;
}

LL ol(LL n)
{
    LL w = n;

    for (int i = 2; i <= sqrt(n); ++i)
    {
        if (n % i == 0)
        {
            w = w / i * (i - 1);

            while (n % i == 0) n /= i;
        }
    }

    if (n >= 2) w = w / n * (n - 1);

    return w;
}


LL a[N];

void solve()
{
    
    LL n;
    
    cin >> n;
    
    LL s = 0;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
        s = max(s, a[i]);
    }
    
    //sort(a + 1, a + n + 1);
    priority_queue<PLL, vector<PLL>, greater<PLL>> p;
    
    PLL pp[N];
    LL np = 0;
    
    for (int i = 1; i <= n; ++i)
    {
        LL o = i;
        while (a[o] == a[i] && o <= n)
            o += 1;
        
        pp[++np] = {a[i], o - i};
        p.push({a[i], np});
        
        i = o - 1;
    }
    
    LL w = 0;
    while (p.size())
    {
        PLL x = p.top();
        //cout << x.first << " " << x.second << endl;
        //cout << w << endl;
        LL l = x.first;
        LL r = x.second;
        
        //cout << l << endl;
        
        if (l == s) break;
        
        if (r == 1 && r + 1 <= np)
        {
            if (l < pp[r + 1].first)
            {
                w += pp[r].second;
                
                pp[r + 1].second += pp[r].second;
            }
            
                p.pop();
            
            //p.push({pp[r].first, r});
            //np -= 1;
            continue;
        }
        
        if (r == np && r - 1 >= 1)
        {
            if (l < pp[r - 1].first)
            {
                w += pp[r].second;
                
                pp[r - 1].second += pp[r].second;
            }
            
                p.pop();
            
            //p.push({pp[r].first, r});
            //np -= 1;
            continue;
        }
        
        if (r > 1 && r < np)
        {
            if (pp[r - 1].first < pp[r + 1].first)
            {
                if (l < pp[r + 1].first)
                {
                    w += pp[r].second;
                    
                    pp[r - 1].second += pp[r].second;
                }
                p.pop();
            
                //p.push({pp[r].first, r});
                //np -= 1;
                continue;
            }
            else
            {
                if (l < pp[r - 1].first)
                {
                    w += pp[r].second;
                    
                    pp[r + 1].second += pp[r].second;
                }
                    p.pop();
                //p.push({pp[r].first, r});
                //np -= 1;
                continue;
            }
            
        }
        
        
    }
    
    cout << w << endl;
    
}

int main()
{
    jiasu;
    
    
    int t = 1;
    cin >> t;

    while (t--) solve();

    return 0;

}