1420A - Cubes Sorting - CodeForces Solution

#include<bits/stdc++.h>
#define int long long
#define F first
#define S second
#define C continue
#define R return
#define B break
#define Pr pair<int,int>
#define logic(x) cout<<(x?"YES":"NO")<<"\n"
#define _ ios::sync_with_stdio(0),cout.tie(0),cin.tie(0);
using namespace std;
const int N = 2e5 + 5;
int T, n, ar[N], b[N], ans, x;
signed main()
{_
    cin >> T;
    while (T--){
        cin >> n;   ans = 0;
        for (int i = 0; i < n; i++) cin >> ar[i], ans += (i && ar[i - 1] > ar[i]);
        logic(ans != n - 1);
    }
    return 0;
}