답안 #705358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705358	2023-03-04T06:24:08 Z	LittleCube	Hacker (BOI15_hac)	C++14	100 / 100	55 ms	14852 KB

hac

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

ll n, h, v[500005], s[500005], sum, ans;

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    h = n / 2;
    for (int i = 0; i < n; i++)
        cin >> v[i];
    for (int i = 0; i < n; i++)
        sum += v[i];
    for (int i = 0; i < h; i++)
        s[0] += v[i];
    for (int i = 1; i < n; i++)
        s[i] = s[i - 1] - v[i - 1] + v[(i + h - 1) % n];
    deque<pll> dq;
    for (int i = 1; i < n - h + 1; i++)
    {
        while (!dq.empty() && dq.back().F < s[i])
            dq.pop_back();
        dq.push_back(pll(s[i], i));
    }
    for (int i = 0; i < n; i++)
    {
        ans = max(ans, sum - dq.front().F);
        if (dq.front().S == i + 1)
            dq.pop_front();
        int j = (i - h + 1 + n) % n;
        while (!dq.empty() && dq.back().F < s[j])
            dq.pop_back();
        dq.push_back(pll(s[j], j));
    }
    cout << ans << '\n';
}

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	11 ms	1492 KB	Output is correct
5	Correct	22 ms	3472 KB	Output is correct
6	Correct	26 ms	4212 KB	Output is correct
7	Correct	32 ms	4948 KB	Output is correct
8	Correct	51 ms	8136 KB	Output is correct

Subtask #4

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	328 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	324 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	328 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	0 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	11 ms	1492 KB	Output is correct
36	Correct	22 ms	3472 KB	Output is correct
37	Correct	26 ms	4212 KB	Output is correct
38	Correct	32 ms	4948 KB	Output is correct
39	Correct	51 ms	8136 KB	Output is correct
40	Correct	2 ms	468 KB	Output is correct
41	Correct	3 ms	684 KB	Output is correct
42	Correct	4 ms	852 KB	Output is correct
43	Correct	21 ms	4308 KB	Output is correct
44	Correct	54 ms	10308 KB	Output is correct
45	Correct	11 ms	2256 KB	Output is correct
46	Correct	33 ms	6340 KB	Output is correct
47	Correct	52 ms	10300 KB	Output is correct
48	Correct	55 ms	14852 KB	Output is correct
49	Correct	44 ms	13816 KB	Output is correct
50	Correct	53 ms	13792 KB	Output is correct