#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;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  int qq;
  cin >> qq;
  while (qq--) {
    ll n;
    bool ans = true;
    cin >> n;
    V<ll> v(n);
    for (ll i = 0; i < (ll)(n); ++i) cin >> v[i];
    V<bool> flag(n, false);
    V<int> tp(0), rev(0);
    tp.push_back(v[0]);
    for (ll i = 0; i < (ll)(n - 1); ++i) {
      if (v[i] > v[i + 1])
        tp.push_back(v[i + 1]);
      else if (v[i] + 1 != v[i + 1])
        ans = false;
    }
    rev = tp;
    sort((rev).begin(), (rev).end());
    reverse((rev).begin(), (rev).end());
    ans &= (rev == tp);
    if (ans)
      cout << "YES" << '\n';
    else
      cout << "NO" << '\n';
  }
}
