Submission #61579236

---

Source Code Expand

#include <bits/stdc++.h>
//#define int long long 
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define fr first
#define se second
#define endl '\n'
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int N = 5e5 + 10;

int n;
int a[N];
ll ans[N];

void solve()
{
    cin >> n;
    vector<int> stop(2 * n + 1); //stop[i] = x表示到第i个人时前面i - 1个人有stop[i]个人停止给他糖
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    int sum_stop = 0;
    for(int i = 1; i <= n; i++){
        sum_stop += stop[i];
        ans[i] = a[i] + (i - 1 - sum_stop);
        int num_out = min(1ll * n - i, ans[i]);
        ans[i] = max(0ll , ans[i] - (n - i));
        stop[i + num_out + 1] ++;
    }
    for(int i = 1;i <= n; i++){
        cout << ans[i] << ' ';
    }
}


signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T=1; //cin>>T;
    while(T--) solve();
    return 0;
}

Submission Info

Judge Result