codeforces - make it good

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast()(ios_base::sync_with_stdio(0),cin.tie(NULL));
int main()
{
    fast();
    ll t;
    cin>>t;
    while(t--)
    {

        ll n;
        cin>>n;
        ll ara[n+1],i,j;
        map<ll , ll>mp;
        ll mx=-1;
        for(i=0;i<n;i++)
        {
            cin>>ara[i];
        }
        i=0,j=n-1;
        vector<ll>v;
        while(i<=j)
        {
            if(v.empty())
            {
                v.emplace_back(0);
            }
            if(i==j)
            {
                if(ara[i]>=v[v.size()-1])v.emplace_back(ara[i]);
                else
                {
                    v.clear();
                    mx=i;
                    j=n ;
                }
                i++,j--;
            }
            else if(ara[i]<ara[j])
            {
                //cout<<v[v.size()-1]<<" "<<ara[i]<<endl;
                if(ara[i]>=v[v.size()-1])v.emplace_back(ara[i]);
                else
                {
                    v.clear();
                    mx=i-1;
                    j=n-1;
                    i--;
                }
                i++;


            }
            else if(ara[j]<=ara[i])
            {
                //cout<<v[v.size()-1]<<" "<<ara[j]<<endl;
                if(ara[j]>=v[v.size()-1])v.emplace_back(ara[j]);
                else
                {
                    v.clear();
                    mx=i;
                    j=n;
                    i++;
                }
                j--;
            }
        }
        if(mx>=0)cout<<mx+1<<endl;
        else cout<<0<<endl;

    }
}