Submission #1201482

#TimeUsernameProblemLanguageResultExecution timeMemory
1201482PlayVoltzGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++20
0 / 100
1 ms328 KiB
#include <cstdio> #include <stdio.h> #include <stdbool.h> #include <iostream> #include <map> #include <vector> #include <climits> #include <stack> #include <string> #include <queue> #include <algorithm> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cctype> #include <bitset> #include <iomanip> #include <cstring> #include <numeric> #include <cassert> using namespace std; #define int long long #define pii pair<int, int> #define mp make_pair #define pb push_back #define fi first #define se second int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, ans=LLONG_MAX/2; cin>>n; vector<int> psum(n+1, 0), ssum(n+2, 0), vect(n+1, 0); for (int i=1; i<=n; ++i)cin>>vect[i], psum[i]=psum[i-1]+max(0ll, vect[i-1]-vect[i]+1); for (int i=n; i>=1; --i)ssum[i]=ssum[i+1]+max(0ll, vect[i+1]-vect[i]+1); for (int i=1; i<=n; ++i)ans=min(ans, max(psum[i], ssum[i])); cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...