#include <bits/stdc++.h>
int main() {
  long int n, k, i, *a, *b, t, max, j;
  scanf("%ld", &t);
  while (t--) {
    scanf("%ld", &n);
    a = (long int *)malloc(n * sizeof(long int));
    b = (long int *)malloc(n * sizeof(long int));
    for (i = 0; i < n; i++) {
      scanf("%ld", &a[i]);
      b[a[i] - 1] = i;
    }
    max = n - 1;
    if (b[0] != 0) k = b[0] - 1;
    for (j = 0, i = 0; j < n - 1; j++) {
      if (b[i] == max) {
        max = k;
        k = b[i + 1] - 1;
        i++;
      } else {
        if (b[i + 1] != b[i] + 1)
          break;
        else
          i++;
      }
    }
    if (j == n - 1)
      printf("Yes\n");
    else
      printf("No\n");
  }
  return 0;
}
