#include <bits/stdc++.h>
const long long MOD = 1000 * 1000 * 1000 + 7;
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int T;
  cin >> T;
  while (T--) {
    long long N;
    cin >> N;
    long long A[N];
    long long flag = 0;
    for (long long i = 0; i < N; i++) {
      cin >> A[i];
    }
    if (N % 2 != 0) {
      for (long long i = 0; i < N; i++) {
        if (A[i] < min(i, N - i - 1)) {
          flag = 1;
          break;
        }
      }
    } else {
      for (long long i = 0; i < N; i++) {
        if (A[i] < min(i, N - i - 1)) {
          flag = 1;
          break;
        }
        if (A[(N / 2) - 1] == A[N / 2] && A[N / 2] == (N / 2) - 1) {
          flag = 1;
          break;
        }
      }
    }
    if (flag == 1)
      cout << "No" << '\n';
    else
      cout << "Yes" << '\n';
  }
  return 0;
}
