#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) {
  if (a % b < 0) {
    return a % b + b;
  }
  return a % b;
}
long long mod_exp(long long a, long long b, long long c) {
  long long res = 1;
  a = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a) % c;
    }
    b /= 2;
    a = (a * a) % c;
  }
  return res;
}
long long mymod(long long a, long long b) { return ((a % b) + b) % b; }
bool prime[200001];
void SieveOfEratosthenes() {
  prime[1] = false;
  for (int p = 2; p * p <= 200000; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 200000; i += p) prime[i] = false;
    }
  }
  return;
}
long long powe[200005];
void power() {
  powe[0] = 1;
  for (long long i = 1; i < 200005; i++) {
    powe[i] = mymod(2 * powe[i - 1], 1000000007);
  }
}
long long gcdExtended(long long, long long, long long *, long long *);
long long modInverse(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
map<pair<long long, long long>, long long> edgeweight;
struct node {
  vector<long long> adj;
  long long colour;
  long long subtree_size;
};
void dfs(node N[], bool vis[], long long i) {
  vis[i] = true;
  N[i].subtree_size = 1;
  for (auto x : N[i].adj) {
    if (!vis[x]) {
      dfs(N, vis, x);
      N[i].subtree_size += N[x].subtree_size;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  for (long long y = 0; y < t; y++) {
    long long n;
    cin >> n;
    long long A[n];
    map<long long, long long> m;
    for (long long i = 0; i < n; i++) {
      cin >> A[i];
      m[A[i]] = i;
    }
    long long last = n - 1;
    long long nextlast = m[1] - 1;
    for (long long i = 2; i < n + 1; i++) {
      if (m[i] == m[i - 1] + 1) {
        continue;
      } else if (m[i - 1] == last) {
        last = nextlast;
        nextlast = m[i] - 1;
      } else {
        cout << "No\n";
        goto hell;
      }
    }
    cout << "Yes\n";
  hell:
    continue;
  }
  return 0;
}
