// @rakibul-islam

#include "bits/stdc++.h"
using namespace std;

using ll = long long;
const ll oo = 1e17;
const ll mod = 1e9 + 7;

void solve() {
  int n;  cin >> n;
  vector<int> a(n);
  int mn = 1e9;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    mn = min(mn, a[i]);
  }
  vector<int> pref(n + 1), suf(n + 1);
  for (int i = 0; i < n; i++) {
    pref[i + 1] = max(pref[i], a[i]);
  }
  for (int i = n - 1; i >= 0; i--) {
    suf[i] = max(suf[i + 1], a[i]);
  }
  int f = 0;
  for (int i = 0; i < n; i++) {
    if (pref[i] > a[i] && suf[i + 1] > a[i]) f++;
  }
  cout << (f <= 1 ? "YES\n" : "NO\n");
} 

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t = 1;  cin >> t;
  for (int test = 1; test <= t; test++) {
    solve();
  }
  return 0;
}