#include <bits/stdc++.h>
using namespace std;
int a[300010];
int b[300010];
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    int n;
    scanf("%d", &n);
    int maxx = 0;
    int maxxp = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      b[n - i + 1] = a[i];
    }
    int len1 = 0, len2 = 0;
    while (len1 < n && a[len1 + 1] >= len1) ++len1;
    while (len2 < n && b[len2 + 1] >= len2) ++len2;
    if (len1 + len2 >= n + 1)
      puts("Yes");
    else
      puts("No");
  }
}
