#include <bits/stdc++.h>
using namespace std;
const long long maxn = 100010;
const long long mod = 1000000007;
const long double eps = 1e-9;
const long long inf = ((1ll << 31ll) - 1ll);
const long long INF = (((1ll << 59ll) - 1ll) * 2ll) + 1ll;
const long double pi = acos(-1);
long long qpow(long long b, long long e) {
  if (!e) return 1;
  if (e & 1) return qpow(b, e - 1) * b % mod;
  long long pwur = qpow(b, e >> 1);
  return pwur * pwur % mod;
}
long long a[maxn];
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(0);
  srand(time(NULL));
  long long tc;
  cin >> tc;
  while (tc--) {
    long long n;
    cin >> n;
    bool b = 1;
    for (long long i = 1; i <= n; i++) {
      cin >> a[i];
      if (i > 1)
        if (a[i] > a[i - 1] + 1) b = 0;
    }
    if (b)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
  return 0;
}
