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

//using u128 = __uint128_t;
#define int                 long long

#define endl                "\n"
#define yes                 cout<<"YES\n"
#define no                  cout<<"NO\n"
#define nl                  cout<<"\n"
#define cnl                 clog<<"\n"

#define lin(n)              int n;cin>>n;
#define vin                 vector<int>
#define pr                  pair<int, int>
#define pp                  pop_back()
#define pb                  push_back
#define em_pb               emplace_back
#define all(x)              x.begin(),x.end()
#define ppfr(v)             v.erase(v.begin());
#define sum_all(v)          accumulate(all(v), 0ll)

#define forn(i,n)           for(int i = 0; i < n; i++)
#define Forn(i,n)           for(int i = 1; i <= n; i++)
#define rforn(i,n)          for(int i = n - 1; i >= 0; i--)
#define print(arr)          for(auto x: arr)cout<<x<<" ";nl;
#define mprint(mp)          for(auto a : mp)cout<<a.first<<" "<<a.second<<endl;

#define _log2(n)            31 - __builtin_clz(n)
#define pop_count(n)        __builtin_popcount(n)

mt19937                     rng(chrono::steady_clock::now().time_since_epoch().count());
#define rng(x,y)            uniform_int_distribution<int>(x,y)(rng)

#ifdef DEBUG
#include<algo/debug.h>
#else
#   define clog if (0) cerr
#   define NB 2500
#   define db(...) "" 
#endif

// const int M = 998244353;
const long long INF = 1e18;
const int M = 1e9 + 7;
const int N = 2e5 + 100;

bool check(vin a, vin b){
  vin aa = a, bb = b;
  sort(all(aa));
  bool f = false, s = false;
  f = (a == aa);
  reverse(all(aa));
  f |= (a == aa);
  sort(all(bb));
  s |= (b == bb);
  reverse(all(bb));
  s |= (b == bb);
  return f and s;
}

void _(){
  lin(n);
  vin v(n);
  forn(i,n)cin >> v[i];
  int mx = *max_element(all(v));
  int mn = *min_element(all(v));
  
  vin a, b;
  for(int i = 0, f = 0; i < n; i++){
    if(v[i] == mn or !f){
      a.push_back(v[i]);
      f |= (v[i] == mn);
    }else if(f){
      b.push_back(v[i]);
    }
  }

  if(check(a, b)){yes; return;}

  a.clear(); b.clear();

  for(int i = n - 1, f = 0; i >= 0; i--){
    if(v[i] == mn or !f){
      a.push_back(v[i]);
      f |= (v[i] == mn);
    }else if(f){
      b.push_back(v[i]);
    }
  }

  check(a, b) ? yes : no;

}

int32_t main(){
    
  ios_base::sync_with_stdio(false);
  cin.tie(NULL); cout.tie(NULL);

  int test = 1;  
  cin>>test;
  for(int i = 1; i <= test; i++){
      // cout << "Case " << i <<": ";
      _();
  }
  return 0;
}