#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 + 99);
const vector<ll> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
template <typename T, typename U>
inline bool chmin(T& t, const U& u) {
  if (t > u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T, typename U>
inline bool chmax(T& t, const U& u) {
  if (t < u) {
    t = u;
    return 1;
  }
  return 0;
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T, typename Y>
inline T mpow(T a, Y n) {
  T res = 1;
  for (; n; n >>= 1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}
template <typename T, typename Y, T(F_up)(T, T), Y(F_gt)(T, Y)>
struct BUPSegTree {
  int sz, ex;
  T ini_d;
  vector<T> dat;
  BUPSegTree(vector<T> init, T _ini_d) : ini_d(_ini_d) {
    int n = (int)(init.size());
    ex = 1;
    while ((1 << ex) < n) ex++;
    sz = (1 << ex);
    dat = vector<T>(2 * sz, ini_d);
    for (int i = 0; i < n; ++i) dat[sz + i] = init[i];
    for (int i = sz - 1; i > 0; --i) dat[i] = F_up(dat[2 * i], dat[2 * i + 1]);
  }
  void up_q(int p, T x) {
    for (dat[p += sz] = x; p > 1; p >>= 1) {
      dat[p >> 1] = F_up(dat[p], dat[p ^ 1]);
    }
  }
  T get_q(int l, int r) {
    T res = ini_d;
    for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
      if (l & 1) {
        res = F_gt(res, dat[l]);
        ++l;
      }
      if (r & 1) {
        --r;
        res = F_gt(res, dat[r]);
      }
    }
    return res;
  }
};
ll my_max(ll a, ll b) { return max(a, b); }
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  int qq;
  cin >> qq;
  while (qq--) {
    ll n;
    cin >> n;
    V<ll> pac(n + 1, 1), pos(n);
    BUPSegTree<ll, ll, my_max, my_max> seg(pac, 1);
    set<int> remp;
    for (ll i = 0; i < (ll)(n); ++i) {
      int x;
      cin >> x;
      x--;
      pos[x] = i;
      remp.insert(i);
    }
    remp.insert(n);
    ll mx = 1, now, nex, tmp;
    bool ans = true;
    for (ll i = 0; i < (ll)(n); ++i) {
      now = pos[i];
      nex = *remp.upper_bound(now);
      if (mx == seg.get_q(now, now + 1)) {
        tmp = seg.get_q(now, now + 1) + seg.get_q(nex, nex + 1);
        seg.up_q(nex, tmp);
        seg.up_q(now, 0);
        remp.erase(now);
      } else {
        ans = false;
      }
      mx = seg.get_q(0, n);
    }
    if (ans)
      cout << "Yes" << '\n';
    else
      cout << "No" << '\n';
  }
}
