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

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

template <typename ND, typename T = typename ND::T>
struct SegIt {
	int n; 
	vector<ND> t;

	SegIt(int _n): n(_n), t(2*n) {}
	SegIt(vector<T> &v): n(v.size()), t(2*n) {
		for(int i=0;i<n;i++)
			t[i+n] = ND(v[i]);
		build();
	}

	void build() {
		for(int i=n-1;i>0;i--)
			t[i] = t[2*i] + t[2*i+1];
	}

	void update(int pos, T val) {
		int p = pos + n ;
		t[p] = ND(val);
		while(p) {
			p /= 2;
			t[p] = t[2*p] + t[2*p+1];
		}
	}
	
	ND query(int l, int r) {
		ND tl, tr;
		r++;
		for(l += n, r += n; l < r; l /= 2, r/= 2) {
			if(l&1) tl = tl + t[l++];
			if(r&1) tr = t[--r] + tr;
		}
		return tl + tr;
	}
};

struct Node {
	using T = int;
	T mn;
	Node(): mn(numeric_limits<T>::max()) {}
	Node(T x): mn(x) {}
	friend Node operator+(Node lhs, Node rhs) {
		return Node(min(lhs.mn, rhs.mn));
	}
};

using Seg = SegIt<Node>;
const int INF = 1e9;

void solve() {
	int n; cin >> n;
	vector<int> p(n); for(int &x: p) cin >> x, x--;
	vector<int> v(n, INF);
	for(int i=0;i<n-1;i++) {
		int a = p[i], b = p[i+1];
		if(a > b) swap(a, b);
		if(a + 1 == b) continue;
		v[a] = min(v[a], b);
	}
	Seg seg(v);
	for(int i=0;i<n;i++) {
		int j = v[i];
		if(j - i <= 2 || j == INF) continue;
		if(seg.query(i, j-1).mn >= j) {
			cout << "No" << '\n';
			return;;
		} 
	}
	cout << "Yes" << '\n';
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int t; cin >> t;
	while(t--)
		solve();
}