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;
typedef long long ll;
int main(){
int N;
cin>>N;
int arr[N];
arr[0] = 1;
int add=0;
for (int i=1; i<N; i++){
int temp;
cin>>temp;
arr[i] = arr[i-1]+temp;
if (arr[i]<0) add = max(0-arr[i], add);
}
for (int j=0; j<N; j++) cout<<add+arr[j]<<' ';
}
# | 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... |