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 n;
int a[500010];
long long p[500010];
const long long inf = 1e17;
int main(int argc, char const *argv[])
{
ios_base :: sync_with_stdio (false);
cin.tie (0);
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int move = (n + 1) >> 1;
long long sum = 0;
for(int i = 0; i < move; i++) {
sum += a[i];
}
for(int i = 0; i < n; i++) {
p[i] = sum;
sum -= a[i];
sum += a[(i + move) % n];
}
long long ans = 0;
for(int i = 0; i < n; i++) {
long long opt = inf;
for(int j = 0; j < move; j++) {
opt = min(opt, p[(i + j) % n]);
}
ans = max(ans, opt);
}
cout << ans << endl;
return 0;
}
# | 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... |