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

#define ll long long
#define endl '\n'

long long toNum(string s){
    long long num = 0;
    for(int i = 0 ; i < s.size() ; i++){
        num = (num * 10) + (s[i] - '0');
    }
    return num;
}

void solve(){
    int n;
    cin >> n;
    int l = 0, r = n - 1;
    vector<int> v(n);
    deque<int> dq;
    for(int i = 0 ; i < n ;i++){
        cin >> v[i];
    }
    while(l <= r && l < n && r < n){
        if(dq.empty()){
            if(v[l] <= v[r]){
                dq.push_back(v[l++]);
            }else{
                dq.push_back(v[r--]);
            }
        }else{
            if(v[l] <= v[r]){
                if(v[l] >= dq.back())    dq.push_back(v[l++]);
                else if(v[l] <= dq.front())  dq.push_front(v[l++]);
                else{
                    cout << "NO\n";
                    return;
                }
            }else{
                if(v[r] >= dq.back())    dq.push_back(v[r--]);
                else if(v[r] <= dq.front())  dq.push_front(v[r--]);
                else{
                    cout << "NO\n";
                    return;
                }
            }
        }
    }
    cout << "YES\n";
}

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}