#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
bool valid;
int n, p[maxn], a[maxn], head, tail;
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &p[i]);
      a[p[i]] = i;
    }
    head = a[1], tail = n;
    valid = true;
    for (int i = 1; i <= n; ++i) {
      if (a[i] != a[i - 1] + 1 && a[i] != head) {
        valid = false;
        break;
      }
      if (a[i] == tail) {
        tail = head - 1;
        head = a[i + 1];
      }
    }
    if (valid)
      puts("Yes");
    else
      puts("No");
  }
  return 0;
}
