oj.uz

Submission #629731

# Submission time Handle Problem Language Result Execution time Memory
629731 2022-08-15T01:33:56 Z heavylightdecomp Hacker (BOI15_hac) C++14
100 / 100
 149 ms 10736 KB 
#include<bits/stdc++.h>
using namespace std;
const int mxN = 2*5e5+5;
int pref[mxN], a[mxN], sig[mxN], n, k;
int rs(int i, int j) {
	if(i <= j) return pref[j] - pref[i-1];
	return rs(i, n) + rs(1, j);
}
signed main() {
	//freopen("hac.in", "r", stdin);
	//freopen("hac.out", "w", stdout);
	cin >> n;
	k = (n + 1) / 2;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= n; i++) pref[i] = a[i] + pref[i-1];
	for(int i = 1; i <= n; i++) {
		if(i+k-1 <= n) sig[i] = rs(i, i+k-1);
		else sig[i] = rs(i, i+k-1-n);
	}
	for(int i = 1; i <= n; i++) sig[i+n] = sig[i];
	//for(int i = 1; i <= 2*n; i++) cerr << sig[i] << '\n';
	deque<int> st;
	int res = INT_MIN;
	for(int i = 1; i <= 2*n; i++) {
		while(st.size() and sig[i] <= sig[st.back()]) st.pop_back();
		st.push_back(i);
		while(st.size() and st.front() + k - 1 < i) st.pop_front();
		if(st.size() && i >= k) res = max(res, sig[st.front()]);
	}
	cout << res << '\n';
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 320 KB Output is correct
4 Correct 26 ms 1852 KB Output is correct
5 Correct 46 ms 4180 KB Output is correct
6 Correct 65 ms 5256 KB Output is correct
7 Correct 75 ms 6488 KB Output is correct
8 Correct 149 ms 10192 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 308 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 2 ms 320 KB Output is correct
35 Correct 26 ms 1852 KB Output is correct
36 Correct 46 ms 4180 KB Output is correct
37 Correct 65 ms 5256 KB Output is correct
38 Correct 75 ms 6488 KB Output is correct
39 Correct 149 ms 10192 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 5 ms 596 KB Output is correct
42 Correct 8 ms 960 KB Output is correct
43 Correct 51 ms 4300 KB Output is correct
44 Correct 130 ms 10196 KB Output is correct
45 Correct 22 ms 2132 KB Output is correct
46 Correct 73 ms 6224 KB Output is correct
47 Correct 124 ms 10232 KB Output is correct
48 Correct 117 ms 10444 KB Output is correct
49 Correct 114 ms 10736 KB Output is correct
50 Correct 97 ms 10624 KB Output is correct