Submission #593075

#TimeUsernameProblemLanguageResultExecution timeMemory
593075piOOEGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
24 ms3848 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<int> a(n), b(n - 1); for (int i = 0; i < n; ++i) { cin >> a[i]; } for (int i = 0; i < n - 1; ++i) { b[i] = a[i + 1] - a[i]; } ll R = 0; for (int i = 0; i < n - 1; ++i) { R += max(0, b[i] + 1); } ll ans = R, L = 0; for (int i = 0; i < n - 1; ++i) { R -= max(0, b[i] + 1); L += max(0, -b[i] + 1); ans = min(ans, max(L, R)); } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...