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

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (auto& ai : a) {
    cin >> ai;
  }
  int l = 0, r = n - 1;
  deque<int> b;
  a[l] <= a[r] ? b.push_back(a[l++]) : b.push_back(a[r--]);
  while (l <= r) {
    if (a[l] <= a[r]) {
      b.back() <= a[l] ? b.push_back(a[l++]) : b.push_front(a[l++]);
    } else {
      b.back() <= a[r] ? b.push_back(a[r--]) : b.push_front(a[r--]);
    }
  }
  cout << (is_sorted(b.begin(), b.end()) ? "YES" : "NO") << '\n';
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}