Submission #861308

#TimeUsernameProblemLanguageResultExecution timeMemory
861308sleepntsheepLabels (NOI20_labels)C++17
0 / 100
8 ms1624 KiB
#include <cstdio> #include <cstring> #include <cassert> #include <string> #include <deque> #include <vector> #include <map> #include <queue> #include <algorithm> #include <iostream> #include <utility> using namespace std; using ll=long long; #define N 200005 #define ALL(x) x.begin(), x.end() int n, d[N], a[N]; int main() { cin.tie(0)->sync_with_stdio(0); cin >> n; for (int i = 0; i < n-1; ++i) cin >> d[i]; a[0] = 1; for (int i = 0; i < n-1; ++i) a[i+1] = a[i] + d[i]; int hi = *max_element(a, a+n); for (int i = 0; i < n; ++i) cout << a[i] + n - hi << ' '; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...