# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384655 | zoooma13 | Hacker (BOI15_hac) | C++14 | 1081 ms | 1644 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;
int main()
{
int n ,sum = 0;
scanf("%d",&n);
int m = (n+1)/2;
int l = n/2;
vector <int> a(n);
for(int&i : a)
scanf("%d",&i) ,sum += i;
a.insert(a.end() ,a.begin() ,a.end());
int ans = 0;
for(int i=0; i<n; i++){
int mx = 0 ,sm = 0;
for(int j=i+1; j<=i+l; j++)
sm += a[j];
mx = sm;
for(int j=i+1; j+l<i+n; j++){
sm = sm - a[j] + a[j+l];
mx = max(mx ,sm);
}
ans = max(ans ,sum-mx);
}
printf("%d\n",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... |