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;
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int sum[n];
int currSum = 0;
int val = (n+1)/2;
for (int i = 0; i < val; i++){
currSum += a[i];
}
for (int i = val; i < (val+n); i++){
sum[i-val] = currSum;
currSum += a[i%n];
currSum -= a[i-val];
}
multiset<int> current;
for (int i = 0; i < val; i++){
current.insert(sum[i]);
}
int answer[n];
for (int i = (val-1); i < (val-1+n); i++){
answer[i%n] = *current.begin();
current.erase(current.find(sum[i-val+1]));
current.insert(sum[(i+1)%n]);
}
cout << *max_element(answer, answer+n) << endl;
}
# | 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... |