#include <bits/stdc++.h>
using namespace std;
string abc = "abcdefghijklmnopqrstuvwxyz";
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long fact(long long n) {
  long long res = 1;
  for (long long z = 2; z <= n; z++) res = res * z;
  return res;
}
long long Pow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
    b >>= 1;
  }
  return res;
}
long long amax(long long a[], long long n) {
  long long max = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] > max) max = a[i];
  }
  return max;
}
long long amin(long long a[], long long n) {
  long long min = 99999999999999999;
  for (long long i = 0; i < n; i++) {
    if (a[i] < min) min = a[i];
  }
  return min;
}
void ip(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
void op(long long a[], long long n) {
  for (long long i = 0; i < n; i++) {
    if (i == n - 1)
      cout << a[i] << endl;
    else
      cout << a[i] << " ";
  }
}
long long divisor(long long x) {
  long long cnt = 0;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i == 0) {
      if (i != x / i)
        cnt += 2;
      else
        cnt += 1;
    }
  }
  return cnt;
}
bool palindrome(long long le, long long ri, string s) {
  if (ri - le <= 0) return true;
  if (s[le] != s[ri]) return false;
  return palindrome(le + 1, ri - 1, s);
}
long long isprm(long long n) {
  if (n <= 1) return 0;
  if (n <= 3) return 1;
  if (n % 2 == 0 || n % 3 == 0) return 0;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return 0;
  return 1;
}
bool psqr(long double x) {
  long double sr = sqrt(x);
  return ((sr - floor(sr)) == 0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    ip(a, n);
    long long j = 0;
    while (j < n - 1) {
      if (a[j + 1] < a[j])
        j++;
      else if (a[j + 1] == (a[j] + 1))
        j++;
      else
        break;
    }
    if (j == n - 1)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return (0);
}
