Cubes Sorting

cf 1420: A

#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#define inf 0x3f3f3f3f
#define lowbit(x)x&-x
using namespace std;
typedef long long ll;
const int maxn = 1000010;
const int mod = 1e9+7;
ll i,j,t;
ll n,ans,sum,cnt,num;
ll a[maxn],b[maxn];
ll flag=0;
int main()
{
    cin>>t;
    while(t--)
    {
        flag=0;
        cin>>n;
        for(i=0; i<n; i++)
            cin>>a[i];
        for(i=1; i<n; i++)
        {
            if(a[i]>=a[i-1])
                flag=1;
        }
        if(flag)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}