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

int main() {
    int t;  
    cin >> t;

    while (t--) {
        int n;
        cin >> n;

        vector<int> A(n);
        for (int i = 0; i < n; ++i) {
            cin >> A[i];
        }

       
        vector<int> sortedA = A;
        sort(sortedA.begin(), sortedA.end());

        int left = 0;
        int right = n - 1;
        bool possible = true;

        
        for (int i = 0; i < n; ++i) {
            if (left <= right && sortedA[i] == A[left]) {
                left++;
            } else if (left <= right && sortedA[i] == A[right]) {
                right--;
            } else {
                possible = false;
                break;
            }
        }

        if (possible) {
            cout << "YES" << endl;
        } else {
            cout << "NO" << endl;
        }
    }

    return 0;
}