ZOJ-4104Sequence in the Pocket

Sequence in the Pocket

#include<stdio.h>
#include<iostream>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<map>
#define ms0(a) memset(a,0,sizeof(a))
#define ll long long
#define ull unsigned long long
#define INF0x3f3f3f3f
using namespace std;

const int maxn = 1e5+10;

int t,n,a[maxn],b[maxn];
int main()
{
    cin>>t;
    while (t--)
    {
        ms0(a);ms0(b);
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            b[i]=a[i];
        }
        sort(b+1, b+n+1);
        int cnt = n;
        for(int i=n;i>=1;i--)
            if(a[i]==b[cnt])
                cnt--;
        printf("%d\n",cnt);
    }
    return 0;
}