This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
int main(){
int n; cin >> n;
vector<int> v(2*n);
for(int i = 0,x; i < n; ++i){
cin >> x;
v[i] = v[i+n] = x;
}
vector<int> ans(n,1e9);
int sum = 0;
int need = (n+1)/2;
for(int i = 0; i < 2*n; ++i){
sum += v[i];
if(i-need+1 >= 0) {
// i-need+1...i
// cerr << i << ' ' << sum << '\n';
for(int j = i-need+1; j <= i; ++j) {
if(j >= n) ans[j-n] = min(ans[j-n],sum);
else ans[j] = min(ans[j],sum);
}
sum -= v[i-need+1];
}
}
int res = 0;
for(int i = 0; i < n; ++i){
res = max(res,ans[i]);
}
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |