#include <bits/stdc++.h>
using namespace std;
int T, n;
int a[300004], v[300004];
int main() {
  scanf("%d", &T);
  while (T--) {
    scanf("%d", &n);
    bool flag = true;
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &a[i]);
      v[i] = min(i - 1, n - i);
    }
    if (n % 2 == 0) {
      if (a[n / 2] > a[n / 2 + 1])
        v[n / 2]++;
      else
        v[n / 2 + 1]++;
    }
    for (int i = 1; i <= n; ++i)
      if (a[i] < v[i]) flag = false;
    if (!flag)
      printf("No\n");
    else
      printf("Yes\n");
  }
  return 0;
}
