답안 #926354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926354 2024-02-12T20:29:02 Z Nonoze Hacker (BOI15_hac) C++17
100 / 100
41 ms 10332 KB
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
typedef long long ll;


#define int long long
#define sz(x) (int)(x.size())
#define debug(x) cerr << (#x) << ": " << (x) << endl
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()


int n, k, m;
vector<int> a;

void solve() {
	cin >> n;
	a.clear(), a.resize(n);
	for (auto &u: a) cin >> u;
	vector<int> sum(n, 0);
	int mid=n/2+n%2;
	for (int i=0; i<mid; i++) sum[0]+=a[i];
	for (int i=1; i<n; i++) {
		sum[i]=sum[i-1]+a[(i+mid-1)%n]-a[i-1];
	}
	// priority_queue<int, vector<int>, greater<int>> curr;
	deque<int> curr;
	for (int i=0; i<mid; i++) {
		while (!curr.empty() && sum[curr.front()]>=sum[i]) curr.pop_front();
		curr.push_front(i);
	}
	int ans=0;
	for (int i=mid; i<n+mid; i++) {
		ans=max(ans, sum[curr.back()]);
		while (!curr.empty() && sum[curr.front()]>=sum[i%n]) curr.pop_front();
		if (!curr.empty() && curr.back()==i-mid) curr.pop_back();
		curr.push_front(i%n);
	}
	cout << ans << endl;
	return;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;// cin >> tt;
	while(tt--) solve();
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 596 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 596 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 7 ms 1880 KB Output is correct
5 Correct 16 ms 3416 KB Output is correct
6 Correct 24 ms 4212 KB Output is correct
7 Correct 25 ms 4952 KB Output is correct
8 Correct 40 ms 8276 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 596 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 7 ms 1880 KB Output is correct
36 Correct 16 ms 3416 KB Output is correct
37 Correct 24 ms 4212 KB Output is correct
38 Correct 25 ms 4952 KB Output is correct
39 Correct 40 ms 8276 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 2 ms 632 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 16 ms 3420 KB Output is correct
44 Correct 40 ms 8276 KB Output is correct
45 Correct 8 ms 2276 KB Output is correct
46 Correct 25 ms 4956 KB Output is correct
47 Correct 41 ms 8276 KB Output is correct
48 Correct 41 ms 8280 KB Output is correct
49 Correct 31 ms 10324 KB Output is correct
50 Correct 36 ms 10332 KB Output is correct