| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 31586 |
2017-08-30T02:04:43 Z |
cheater2k |
Hacker (BOI15_hac) |
C++14 |
|
16 ms |
3868 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int n;
int a[N], f[N];
int ans;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
int sz = (n + 1) / 2;
for (int i = n + 1; i <= 2 * n; ++i) a[i] = a[i - n];
for (int i = 1; i <= n + n; ++i) a[i] = a[i - 1] + a[i];
for (int i = sz; i <= n + n; ++i) {
f[i] = a[i] - a[i - sz];
//cerr << i << ' ' << f[i] << endl;
}
deque <int> q;
for (int i = 1; i <= n + n; ++i) {
while(!q.empty() && f[q.back()] > f[i]) q.pop_back();
if (!q.empty() && q.front() <= i - sz) q.pop_front();
q.push_back(i);
ans = max(ans, f[q.front()]);
}
cout << ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 6 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 8 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 9 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 10 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 11 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 12 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 13 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 14 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 15 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 16 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 17 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 18 |
Correct |
0 ms |
3736 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 6 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 8 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 9 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 10 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 11 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 12 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 13 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 14 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 15 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 16 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 17 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 18 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 19 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 20 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 21 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 22 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 23 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 24 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 25 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 26 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 27 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 28 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 29 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 30 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 31 |
Correct |
0 ms |
3736 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 4 |
Correct |
9 ms |
3868 KB |
Output is correct |
| 5 |
Runtime error |
16 ms |
3736 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 6 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 8 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 9 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 10 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 11 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 12 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 13 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 14 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 15 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 16 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 17 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 18 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 19 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 20 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 21 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 22 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 23 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 24 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 25 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 26 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 27 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 28 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 29 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 30 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 31 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 32 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 33 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 34 |
Correct |
0 ms |
3736 KB |
Output is correct |
| 35 |
Correct |
9 ms |
3868 KB |
Output is correct |
| 36 |
Runtime error |
16 ms |
3736 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 37 |
Halted |
0 ms |
0 KB |
- |
