题目

思路：

#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 = 1e6;
// const int mod = 1e9 + 7;
const int mod = 998244353;
// int a[505][5005];
// bool vis[505][505];
// char s[505][505];
int a[maxn], b[maxn];
int vis[maxn];
string s;
int n, m;

struct Node{
    int val, id;
    bool operator<(const Node &u)const{
        return val < u.val;
    }
};
// Node c[maxn];

int ans[maxn], sum[maxn];
int pre[maxn], suf[maxn];

//long long ? maxn ?

void solve(){
    int res = 0;
    int q, k;
    int sum = 0;
    int mx = 0;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        // sum[i] = sum[i - 1] + a[i];
        sum += a[i];
    }
    a[0] = a[n + 1] = 0;
    for(int i = 1; i <= n; i++){
        pre[i] = max(pre[i - 1], a[i]);
    }
    suf[n + 1] = 0;
    for(int i = n; i >= 1; i--){
        suf[i] = max(suf[i + 1], a[i]);
    }
    for(int i = 1; i <= n; i++){
        mx = max(pre[i - 1], suf[i + 1]);
        int rest = sum - a[i] - mx;
        if(a[i] > sum - a[i]){
            ans[i] = 1;
            continue;
        }
        int dif;
        if(mx >= rest){
            dif = mx - rest;
        }
        else{
            dif = (rest + mx) % 2;
        }
        if(a[i] > dif){
            ans[i] = 1;
        }
        else{
            ans[i] = 0;
        }
    }
    for(int i = 1; i <= n; i++){
        cout << ans[i] << " \n"[i == n];
    }
}
    
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}