Reorder the Books HDU - 5500

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <queue>
#define maxn 200005
using namespace std ;
int a[maxn];
int main()
{
int T;
cin>>T;
for(int Case=1;Case<=T;Case++)
{
int n,pos;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
if(a[i]==n)
{
pos=i;
}
}
int ans=0;
ans=n-pos;
int need=n-1;
for(int i=pos-1;i>=1;i--)
{
if(a[i]==need)
{
need--;
}
else
{
ans++;
}
}
cout<<ans<<endl;
}
return 0;
}