#include <iostream>
#include <queue>
using namespace std;
#define int long long
#define N 200005
int a[N];
priority_queue <int> q;
signed main()
{
    int _;
    cin >> _;
    while(_--)
    {
        int n;
        cin >> n;
        int mx = 0;
        for(int i = 1; i <= n; i++)
        {
            cin >> a[i];
            mx = max(mx, a[i]);
        }
        a[n + 1] = mx;
        int ans = 0;
        for(int i = 1; i <= n + 1; i++)
        {
            if(a[i] == mx)
            {
                if(!q.empty())
                {
                    int pre = mx, cnt = 0;
                    while(!q.empty())
                    {
                        if(q.top() == pre)
                        {
                            ans += cnt;
                            q.pop();
                        }
                        else
                        {
                            cnt++;
                            ans += cnt;
                            pre = q.top();
                            q.pop();
                        }
                    }
                }
            }
            else
                q.push(a[i]);
        }
        cout << ans << endl;
    }
    return 0;
}