Submission #38019678

---

Source Code Expand

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define ff(i,s,f) for(ll i=s;i<f;i++)
#define fb(i,s,f) for(ll i=(s)-1;i>=f;i--)
#define ffi(i,s,f) for(ll i=s;i<=f;i++)
#define fbi(i,s,f) for(ll i=s;i>=f;i--)
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,ll) sort(a.begin(),a.end(),greater<ll>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define ub(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<ll,ll> pll;
typedef string str;

const ll maxn=2e5+10;

ll a[maxn];
ll b[maxn];

void solve(){
    ll n;
    cin>>n;
    ff(i,0,n) cin>>a[i];
    ll sum=0;
    ll cnt=0;
    ff(i,0,n){
        cnt+=a[i];
        sum+=a[i]*i;
    }
    ll dpref=-1;
    ll dsuf=-1;
    ll tren=0;
    ff(i,0,n){
        tren+=a[i];
        if(tren==-1) dpref=i;
    }
    tren=0;
    fb(i,n,0){
        tren+=a[i];
        if(tren==1) dsuf=i;
    }
    if(cnt==0){
        cout<<"No\n";
    }else if(dpref!=-1){
        cout<<"Yes\n";
        ll x=-sum/cnt;
        while(x*cnt+sum<0) x+=cnt/abs(cnt);
        ll dod=x*cnt+sum;
        for(ll i=0;i<n;i++){
            if(i<=dpref){
                cout<<x+i-dod<<" ";
            }else cout<<x+i<<" ";
        }
    }else if(dsuf!=-1){
        cout<<"Yes\n";
        ll x=-sum/cnt;
        while(x*cnt+sum>0) x-=cnt/abs(cnt);
        ll dod=x*cnt+sum;
        for(ll i=0;i<n;i++){
            if(i>=dsuf){
                cout<<x+i-dod<<" ";
            }else cout<<x+i<<" ";
        }
    }else{
        cout<<"No\n";
    }
}

int main(){
    ios;
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

Submission Info

Judge Result