# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
479387 |
2021-10-11T14:57:41 Z |
Lobo |
Hacker (BOI15_hac) |
C++17 |
|
1 ms |
332 KB |
#include <bits/stdc++.h>
using namespace std;
const long long INFll = (long long) 1e18 + 10;
const int INFii = (int) 1e9 + 10;
typedef long long ll;
typedef int ii;
typedef long double dbl;
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
#define maxn 1050000
ii n, v[maxn], r[maxn], ps[maxn];
int main() {
ios::sync_with_stdio(false); cin.tie(0);
//freopen("in.in", "r", stdin);
//freopen("out.out", "w", stdout);
cin >> n;
for(ii i = 1; i <= n; i++) {
cin >> v[i];
v[i+n] = v[i];
}
for(ii i = 1; i <= 2*n; i++) {
ps[i] = ps[i-1] + v[i];
r[i] = INFii;
}
ii ans = 0;
for(ii i = 1; i <= n; i++) {
r[i] = min(r[i],ps[i+(n+1)/2-1]-ps[i-1]);
}
for(ii i = n+1; i <= 2*n; i++) {
r[i] = min(r[i],ps[i]-ps[i-(n+1)/2]);
}
ii sz2 = ((n+1)/2 - 1)/2;
ii sz1 = (n+1)/2 - 1 - sz2;
if(sz1 == sz2) {
for(ii i = 1; i <= 2*n; i++) {
if(i-sz1 >= 1 && i+sz2 <= 2*n) {
r[i] = min(r[i],ps[i+sz2]-ps[i-sz1-1]);
}
}
}
else {
for(ii i = 1; i <= 2*n; i++) {
if(i-sz1 >= 1 && i+sz2 <= 2*n) {
r[i] = min(r[i],ps[i+sz2]-ps[i-sz1-1]);
}
if(i-sz2 >= 1 && i+sz1 <= 2*n) {
r[i] = min(r[i],ps[i+sz1]-ps[i-sz2-1]);
}
}
}
for(ii i = 1; i <= n; i++) {
ans = max(ans, min(r[i],r[i+n]));
}
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |