This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define pii pair<int,int>
#define vi vector<int>
#define si set<int>
#define pb push_back
void solve() {
int n; cin >> n;
vi a(n),sum(n),dp(n);
sum[0]=0;
for (int i = 1; i < n; i++) {
cin >> a[i];
sum[i] = sum[i-1]+a[i];
}
auto it = max_element(sum.begin(), sum.end());
int x = *min_element(sum.begin(), sum.end()),idx = it-sum.begin();
if (*it-x != n-1) {
cout << "-1" << endl;
return;
}
dp[idx] = n;
for (int i = idx+1; i < n; i++) dp[i] = dp[i-1]+a[i];
for (int i = idx-1; i >= 0; i--) dp[i] = dp[i+1]-a[i+1];
for (int i = 0; i < n; i++) cout << dp[i] << ' ';
cout << endl;
return;
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int tt=1; //cin>>tt;
while(tt--) {
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |