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;
//Compiler version g++ 6.3.0
int main()
{
int n;
ios_base::sync_with_stdio(false);
cin >> n;
int arr[n];
int k = (n+1) / 2;
int s = 0;
for(int i =0;i < n;i++){
cin >> arr[i];
if(i<k) s += arr[i];
}
int pre[n];
pre[0] = s;
for(int i = 0;i < n - 1;i++){
s += arr[(i+k)%n];
s -= arr[i];
pre[i+1] = s;
}
multiset<int> x;
for(int i= 0; i < k; i++){
x.insert(pre[i]);
}
int ans = *x.begin();
for(int i = 0;i < n - 1;i++){
x.insert(pre[(i+k)%n]);
x.erase(x.find(pre[i]));
ans = max(ans,*x.begin());
}
cout << ans;
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... |