Submission #522244

#TimeUsernameProblemLanguageResultExecution timeMemory
522244AdamGSGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
26 ms6988 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define rep(a, b) for(int a = 0; a < (b); ++a) #define st first #define nd second #define pb push_back #define all(a) a.begin(), a.end() const int LIM=2e5+7; const ll INF=1e18+7; ll T[LIM], pref[LIM], suf[LIM]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; rep(i, n) cin >> T[i]; for(int i=1; i<n; ++i) { pref[i]=pref[i-1]; if(T[i-1]>=T[i]) pref[i]+=T[i-1]-T[i]+1; } for(int i=n-2; i>=0; --i) { suf[i]=suf[i+1]; if(T[i+1]>=T[i]) suf[i]+=T[i+1]-T[i]+1; } ll ans=INF; rep(i, n) ans=min(ans, max(pref[i], suf[i])); cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...