#include<bits/stdc++.h>
#define int long long
#define mod 998244353
using namespace std;
const int Max = 200005;
int n, a[Max], t;
bool f[Max];
signed main() {
	cin >> t;
	while (t--) {
		cin >> n;
		for (int i = 1; i <= n; i++) cin >> a[i];
		f[0] = 1;
		fill(f + 1, f + 1 + n, 0);
		for (int i = 0; i <= n; i++) {
			if (i > a[i] && f[i-a[i]-1]  ) {
				f[i] = 1;
			}
			if (i+a[i+1]+1<=n  ) {
				f[i+1+a[i+1]] = 1;private
			}
		}
		cout<<(f[n]==1?"YES":"NO")<<'\n';
	}
}