# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361419 | kimbj0709 | Hacker (BOI15_hac) | C++14 | 594 ms | 51788 KiB |
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;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
vector<int> vect1;
int input;
for(int i=0;i<n;i++){
cin >> input;
vect1.push_back(input);
}
for(int i=0;i<3;i++){
for(int j=0;j<n;j++){
vect1.push_back(vect1[j]);
}
}
vector<int> prefix(n*10,0);
for(int i=0;i<vect1.size();i++){
prefix[i] = vect1[i];
if(i!=0){
prefix[i] += prefix[i-1];
}
}
int mx = 3*n;
int mx2 = 2*n;
n = (n+1)/2;
vector<int> nums(n*10,0);
for(int i=0;i<mx;i++){
int currsum = prefix[i+n-1];
if(i!=0){
currsum -= prefix[i-1];
}
nums[i] = currsum;
}
multiset<int> set1;
int ans = 0;
for(int i=0;i<n;i++){
set1.insert(nums[i]);
}
ans = *set1.begin();
for(int i=n;i<=mx2;i++){
set1.insert(nums[i]);
set1.erase(set1.find(nums[i-n]));
ans = max(ans,*set1.begin());
//cout << *set1.begin() << " " << set1.size() << "\n";
}
cout << ans;
}
Compilation message (stderr)
# | 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... |