# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909387 | shoryu386 | Hacker (BOI15_hac) | C++17 | 1 ms | 348 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;
#define MAX 200007
#define int long long
main(){
int n; cin >> n;
int count = (n+1)/2;
int arr[2*n];
for (int x = 0; x < n; x++) cin >> arr[x];
for (int x = 0; x < n; x++) arr[n + x] = arr[x];
int hmm[n]; memset(hmm, 63, sizeof(hmm));
int sums[n];
for (int x = 0; x < n; x++){
int sum = 0;
for (int y = x; y < x+count; y++){
sum += arr[y];
}
sums[x] = sum;
//hmm is min of all values from x-count+1 to x
for (int y = x; y < x+count; y++){
hmm[y % n] = min(hmm[y % n], sum);
}
}
multiset<int> ms;
for (int x = 0; x < count; x++){
ms.insert(sums[x]);
}
hmm[0] = *ms.begin();
for (int x = 1; x < n; x++){
ms.insert(sums[count+1-x]);
ms.erase(ms.find(sums[x-1]));
hmm[x] = *ms.begin();
}
int ans = INT_MIN;
for (int x = 0; x < n; x++){
ans = max(ans, hmm[x]);
}
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... |