//#pragma GCC optimize ("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
//#include <x86intrin.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define PI 3.141592653589793L
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
// Use for file I/O;
#define FIN string _fname = "input"; \
			string _is = _fname + ".in", _os = _fname + ".out"; \
			freopen(_is.c_str(), "r", stdin); \
			freopen(_os.c_str(), "w", stdout);

#define FIN2 freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define RINIT mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define gsize(x) (int)((x).size())

using namespace std;
//using namespace __gnu_pbds;
//typedef gp_hash_table<int, int, hash<int>> ht;

const char nl = '\n';

typedef long long ll;
typedef long double ld;
// typedef unsigned int uint;
typedef unsigned long long ull;

const ll inf = 1e9 + 10;
const ll inf2 = 1e18 + 99LL;
const ld inf3 = 1e14;
const ll mod = 1e9+7, mod2 = 998244353;
const ld eps = 1e-9;
const bool local = false;

const int logn = 18, maxn = 200005, maxm = 10001, maxn2 = 3;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    if (n <= 2) {
        cout << "YES" << nl;
        return;
    }
    
    set<int> ts = {a[0], a[1]};
    for (int i = 2; i < n; i++) {
 //       if (a[i] < max(a[i - 2], a[i - 1]) && a[i] > min(a[i - 2], a[i - 1])) {
 //           cout << "NO" << nl;
 //           return 0;
 //       }
        if (a[i - 1] < a[i]) {
            auto r = ts.upper_bound(a[i - 1]);
            if (r != ts.end() && *r < a[i]) {
                cout << "NO" << nl;
                return;
            }
        } else if (a[i - 1] > a[i]) {
            auto r = ts.find(a[i - 1]);
            if (r != ts.begin()) {
                r = prev(r);
                auto x = *r;
                if (x > a[i]) {
                    cout << "NO" << nl;
                    return;
                }
            }
        }
        
        ts.insert(a[i]);
    }
    cout << "YES" << nl;
}

int main() {
    FAST; RINIT;
    
    int t;
    cin >> t;
    while (t--) solve();
}


// © Benq 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/
