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>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N;
cin >> N;
vector<int> a(N);
long long s = 0;
for (int &v: a) {
cin >> v;
s += v;
}
for (int i = 0; i < N; i++) a.push_back(a[i]);
long long res = 0;
for (int i = 0; i < N; i++) {
int len = N / 2;
long long window = 0;
for (int k = i+1; k < i+len+1; k++) window += a[k];
long long best = window;
window = 0;
for (int j = 0; j < len; j++) window += a[j];
for (int r = len; r < N + N; r++) {
window += a[r];
window -= a[r - len];
if ((r - len + 1) % N <= i && r % N >= i) continue;
best = max(window, best);
}
res = max(res, s - best);
}
cout << res;
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... |