#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	owo
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		vector<ll>a(n);
		for(int i=0;i<n;i++)cin>>a[i];
		VII dp(n,vector<ll>(n,INF));
		for(int i=0;i<a[0];i++){
			dp[0][i] = 0;
		}
		for(int i=1;i<n;i++){
			ll cur = 0;
			for(int j=i-1;j>=0;j--){
				if(j+a[j] >= i){ //if extends past i
					dp[i][a[j]+j] = min(dp[i][a[j]+j],dp[j][i-1]+cur);
					cur++;
				}
			}
			for(int j=i+1;j<n;j++){
				dp[i][j] = min(dp[i][j],dp[i][j-1]);
			}
		}
		cout<<dp[n-1][n-1]<<'\n';
	}
}
