直接上答案

#include<bits/stdc++.h>
using namespace std;
int T,d[200007],n,a,ans,tmp;
int main(){
    cin>>T; 
    while(T--){
        cin>>n;
        memset(d,0,sizeof(d));
        tmp=0; 
        for (int i=1;i<=n;i++){
            cin>>a;
            d[i+1]--;
            d[max(1,i-a+1)]++; 
        }
        for (int i=1;i<=n;i++){
            tmp+=d[i];
            cout<<(tmp>0);
			cout<<' ';
        }
        cout<<endl; 
    }
    return 0;
}