Submission #771183

#TimeUsernameProblemLanguageResultExecution timeMemory
771183Trisanu_DasGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
0 / 100
1 ms340 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int a[(int)(2e5 + 5)], p[(int)(2e5 + 5)], s[(int)(2e5 + 5)]; signed main(){ int n; cin >> n; for(int i = 1; i < n + 1; i++) cin >> a[i]; for(int i = 1; i < n + 2; i++) p[i] = p[i - 1] + max(0ll, a[i - 1] - a[i] + 1); for(int i = n; i > -1; i--) s[i] = s[i + 1] + max(0ll, a[i + 1] - a[i] + 1); int ans = INT_MAX; for(int i = 0; i < n; i++) ans = min(ans, max(p[i], s[i])); cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...