Codeforces Global Round 7 B - Maximums (thinking title)

Meaning of the questions:

An array of a _n- , defined X _I  is a front i - 1 bit maximum value (X ₀  = 0), is defined B _I as a _I - X _I , to give the array B _n- , reducing the array a _n- .

Ideas:

Since X ₀  = 0, so the B ₀ = A _0, after the maintenance to the maximum.

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    int n;cin>>n;
    ll b[n];for(ll &i:b) cin>>i;
    ll a[n]={b[0]};
    ll mx=b[0];
    for(int i=1;i<n;i++){
        a[i]=mx+b[i];
        if(b[i]>0) mx+=b[i];
    }
    for(int i:a) cout<<i<<' ';
    return 0;
}