Submission #1171412

#TimeUsernameProblemLanguageResultExecution timeMemory
1171412chikien2009Growing Vegetables is Fun 4 (JOI21_ho_t1)C++20
100 / 100
12 ms4236 KiB
#include <bits/stdc++.h> using namespace std; void setup() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int n, a[200000]; long long pre[200000], suf[200000], res = 1e18; int main() { setup(); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; pre[i] = (i == 0 ? 0 : pre[i - 1] + max(0, a[i - 1] - a[i] + 1)); } for (int i = n - 1; i >= 0; --i) { suf[i] = (i == n - 1 ? 0 : suf[i + 1] + max(0, a[i + 1] - a[i] + 1)); res = min(res, max(pre[i], suf[i])); } cout << res; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...