题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e9, maxm = 4e4 + 5;
const int N = 1e5;const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];
int n, m;
int a[maxn];string s;struct Node{// int val, id;// bool operator<(const Node &u)const{//     return val < u.val;//!!!!!!!!!!!!!!!!!!// }int v, w;
};//long long ? maxn ? n? m?
void solve(){int res = 0;int k, q;cin >> n;int sum = 0;vector<int> c(n + 5), d(n + 5, 0);for(int i = 1; i <= n; i++){cin >> c[i];sum += c[i];}int cnt = sum / n;//当前a数组前缀有几个1int sd = 0;for(int i = n; i >= 1; i--){sd += d[i];int now = c[i] + sd;d[max(0LL, i - cnt)]++;//先更新差分数组sd--;if(now == i){a[i] = 1;cnt--;//再更新cnt}else{a[i] = 0;}}for(int i = 1; i <= n; i++){cout << a[i] << " \n"[i == n];}
}   signed main(){ios::sync_with_stdio(0);cin.tie(0);int T = 1;cin >> T;while (T--){solve();}return 0;
}