#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
template <class T>
T gcd(const T a, const T b) {
  return (b ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(const T a, const T b) {
  return (a / gcd<T>(a, b) * b);
}
struct node {
  long long x, y;
  node() {}
  node(long long x, long long y) : x(x), y(y) {}
  bool operator<(const node& p) const { return x < p.x; }
};
long long a[300006], b[300005], c[300005];
int main() {
  long long i, j, k, l, t, n, m, l1, l2, x, y, z;
  scanf("%lld", &t);
  while (t--) {
    scanf("%lld", &n);
    l1 = -1;
    bool ck = 0;
    for (i = 0; i < n; i++) {
      scanf("%lld", &a[i]);
      if (!ck && a[i] >= i) {
        l1++;
      } else
        ck = 1;
    }
    ck = 0;
    l2 = n;
    for (i = n - 1, j = 0; i >= 0; i--, j++) {
      if (!ck && a[i] >= j) {
        l2--;
      } else
        ck = 1;
    }
    if (l1 >= l2) {
      deb("Yes");
    } else if (abs(l2 - l1) == 1 && (a[l1] > l2 || a[l2] > l1)) {
      deb("Yes");
    } else if (abs(l2 - l1) == 2 && a[l1 + 1] > l1 && a[l1 + 1] > l2) {
      deb("Yes");
    } else
      deb("No");
  }
  return 0;
}
