답안 #251765

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
251765	2020-07-22T09:37:56 Z	tutis	Hacker (BOI15_hac)	C++17	100 / 100	85 ms	22116 KB

hac

/*input
4
7 6 8 4
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename K>
using ordered_map = tree<T, K, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	ll h[n];
	for (int i = 0; i < n; i++)
		cin >> h[i];
	int sz = 2 * n;
	ll s[sz + 1];
	s[0] = 0;
	for (int i = 1; i <= sz; i++)
		s[i] = s[i - 1] + h[i % n];
	ll k = (n + 1) / 2;
	vector<ll>X;
	for (int i = k; i <= sz; i++)
		X.push_back(s[i] - s[i - k]);
	deque<pair<ll, ll>>A;
	for (int i = 0; i < k; i++)
	{
		while (!A.empty() && A.back().first >= X[i])
			A.pop_back();
		A.push_back({X[i], i});
	}
	ll ans = A[0].first;
	for (int i = k; i < (int)X.size(); i++)
	{
		while (!A.empty() && A.back().first >= X[i])
			A.pop_back();
		A.push_back({X[i], i});
		while (A[0].second <= i - k)
			A.pop_front();
		ans = max(ans, A[0].first);
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	0 ms	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	512 KB	Output is correct
24	Correct	1 ms	512 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	2 ms	640 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	256 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	512 KB	Output is correct
4	Correct	13 ms	3324 KB	Output is correct
5	Correct	39 ms	9324 KB	Output is correct
6	Correct	38 ms	10412 KB	Output is correct
7	Correct	45 ms	11628 KB	Output is correct
8	Correct	76 ms	20456 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	384 KB	Output is correct
20	Correct	0 ms	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	1 ms	512 KB	Output is correct
23	Correct	1 ms	512 KB	Output is correct
24	Correct	1 ms	512 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	2 ms	640 KB	Output is correct
27	Correct	0 ms	384 KB	Output is correct
28	Correct	0 ms	256 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	1 ms	512 KB	Output is correct
31	Correct	1 ms	512 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	1 ms	512 KB	Output is correct
35	Correct	13 ms	3324 KB	Output is correct
36	Correct	39 ms	9324 KB	Output is correct
37	Correct	38 ms	10412 KB	Output is correct
38	Correct	45 ms	11628 KB	Output is correct
39	Correct	76 ms	20456 KB	Output is correct
40	Correct	2 ms	768 KB	Output is correct
41	Correct	3 ms	1152 KB	Output is correct
42	Correct	5 ms	1664 KB	Output is correct
43	Correct	31 ms	9332 KB	Output is correct
44	Correct	74 ms	20456 KB	Output is correct
45	Correct	16 ms	4856 KB	Output is correct
46	Correct	44 ms	11628 KB	Output is correct
47	Correct	85 ms	20456 KB	Output is correct
48	Correct	66 ms	20456 KB	Output is correct
49	Correct	62 ms	22116 KB	Output is correct
50	Correct	64 ms	22116 KB	Output is correct