oj.uz

Submission #31589

# Submission time Handle Problem Language Result Execution time Memory
31589 2017-08-30T02:06:19 Z cheater2k Hacker (BOI15_hac) C++14
100 / 100
 83 ms 11048 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1000010;

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;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9988 KB Output is correct
2 Correct 0 ms 9988 KB Output is correct
3 Correct 0 ms 9988 KB Output is correct
4 Correct 0 ms 9988 KB Output is correct
5 Correct 0 ms 9988 KB Output is correct
6 Correct 0 ms 9988 KB Output is correct
7 Correct 0 ms 9988 KB Output is correct
8 Correct 0 ms 9988 KB Output is correct
9 Correct 0 ms 9988 KB Output is correct
10 Correct 0 ms 9988 KB Output is correct
11 Correct 0 ms 9988 KB Output is correct
12 Correct 0 ms 9988 KB Output is correct
13 Correct 0 ms 9988 KB Output is correct
14 Correct 0 ms 9988 KB Output is correct
15 Correct 0 ms 9988 KB Output is correct
16 Correct 0 ms 9988 KB Output is correct
17 Correct 0 ms 9988 KB Output is correct
18 Correct 0 ms 9988 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9988 KB Output is correct
2 Correct 0 ms 9988 KB Output is correct
3 Correct 0 ms 9988 KB Output is correct
4 Correct 0 ms 9988 KB Output is correct
5 Correct 0 ms 9988 KB Output is correct
6 Correct 0 ms 9988 KB Output is correct
7 Correct 0 ms 9988 KB Output is correct
8 Correct 0 ms 9988 KB Output is correct
9 Correct 0 ms 9988 KB Output is correct
10 Correct 0 ms 9988 KB Output is correct
11 Correct 0 ms 9988 KB Output is correct
12 Correct 0 ms 9988 KB Output is correct
13 Correct 0 ms 9988 KB Output is correct
14 Correct 0 ms 9988 KB Output is correct
15 Correct 0 ms 9988 KB Output is correct
16 Correct 0 ms 9988 KB Output is correct
17 Correct 0 ms 9988 KB Output is correct
18 Correct 0 ms 9988 KB Output is correct
19 Correct 0 ms 9988 KB Output is correct
20 Correct 0 ms 9988 KB Output is correct
21 Correct 0 ms 9988 KB Output is correct
22 Correct 0 ms 9988 KB Output is correct
23 Correct 0 ms 9988 KB Output is correct
24 Correct 0 ms 9988 KB Output is correct
25 Correct 0 ms 9988 KB Output is correct
26 Correct 0 ms 9988 KB Output is correct
27 Correct 0 ms 9988 KB Output is correct
28 Correct 0 ms 9988 KB Output is correct
29 Correct 0 ms 9988 KB Output is correct
30 Correct 0 ms 9988 KB Output is correct
31 Correct 0 ms 9988 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9988 KB Output is correct
2 Correct 0 ms 9988 KB Output is correct
3 Correct 0 ms 9988 KB Output is correct
4 Correct 9 ms 10120 KB Output is correct
5 Correct 23 ms 10388 KB Output is correct
6 Correct 33 ms 10520 KB Output is correct
7 Correct 33 ms 10520 KB Output is correct
8 Correct 83 ms 11048 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9988 KB Output is correct
2 Correct 0 ms 9988 KB Output is correct
3 Correct 0 ms 9988 KB Output is correct
4 Correct 0 ms 9988 KB Output is correct
5 Correct 0 ms 9988 KB Output is correct
6 Correct 0 ms 9988 KB Output is correct
7 Correct 0 ms 9988 KB Output is correct
8 Correct 0 ms 9988 KB Output is correct
9 Correct 0 ms 9988 KB Output is correct
10 Correct 0 ms 9988 KB Output is correct
11 Correct 0 ms 9988 KB Output is correct
12 Correct 0 ms 9988 KB Output is correct
13 Correct 0 ms 9988 KB Output is correct
14 Correct 0 ms 9988 KB Output is correct
15 Correct 0 ms 9988 KB Output is correct
16 Correct 0 ms 9988 KB Output is correct
17 Correct 0 ms 9988 KB Output is correct
18 Correct 0 ms 9988 KB Output is correct
19 Correct 0 ms 9988 KB Output is correct
20 Correct 0 ms 9988 KB Output is correct
21 Correct 0 ms 9988 KB Output is correct
22 Correct 0 ms 9988 KB Output is correct
23 Correct 0 ms 9988 KB Output is correct
24 Correct 0 ms 9988 KB Output is correct
25 Correct 0 ms 9988 KB Output is correct
26 Correct 0 ms 9988 KB Output is correct
27 Correct 0 ms 9988 KB Output is correct
28 Correct 0 ms 9988 KB Output is correct
29 Correct 0 ms 9988 KB Output is correct
30 Correct 0 ms 9988 KB Output is correct
31 Correct 0 ms 9988 KB Output is correct
32 Correct 0 ms 9988 KB Output is correct
33 Correct 0 ms 9988 KB Output is correct
34 Correct 0 ms 9988 KB Output is correct
35 Correct 9 ms 10120 KB Output is correct
36 Correct 23 ms 10388 KB Output is correct
37 Correct 33 ms 10520 KB Output is correct
38 Correct 33 ms 10520 KB Output is correct
39 Correct 83 ms 11048 KB Output is correct
40 Correct 3 ms 9988 KB Output is correct
41 Correct 0 ms 9988 KB Output is correct
42 Correct 3 ms 9988 KB Output is correct
43 Correct 29 ms 10388 KB Output is correct
44 Correct 79 ms 11048 KB Output is correct
45 Correct 19 ms 10120 KB Output is correct
46 Correct 36 ms 10520 KB Output is correct
47 Correct 59 ms 11048 KB Output is correct
48 Correct 49 ms 11048 KB Output is correct
49 Correct 46 ms 11048 KB Output is correct
50 Correct 53 ms 11048 KB Output is correct