#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long int powe(long long int n, long long int m) {
  if (m == 0) return 1;
  long long int t = powe(n, m / 2);
  if (m % 2 == 0) return (t * t);
  return (((t * t)) * n);
}
long long int mpowe(long long int n, long long int m) {
  if (m == 0) return 1;
  long long int t = powe(n, m / 2);
  t %= 1000000000000000007;
  if (m % 2 == 0) return (t * t) % 1000000000000000007;
  return (((t * t) % 1000000000000000007) * n) % 1000000000000000007;
}
long long int logtwo(long long int n) {
  if (n == 1) return 0;
  return logtwo(n / 2) + 1;
}
long long int binpow(long long int a, long long int b, long long int m) {
  a %= m;
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
long long int A[100005];
void solve() {
  long long int n, pos = -1, i, lpos, p = 0;
  cin >> n;
  lpos = n;
  long long int a[n];
  for (long long int i = 0; i < n; i++) cin >> a[i];
  ;
  for (i = 0; i < n; i++) {
    if (a[i] < i) break;
    pos = i;
  }
  for (i = n - 1; i >= 0; i--) {
    if (a[i] < (n - 1 - i)) break;
    lpos = i;
  }
  if (lpos <= pos)
    cout << "Yes" << '\n';
  else
    cout << "No" << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) solve();
}
