답안 #31575 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
31575	2017-08-30T01:49:35 Z	ngkan146	Hacker (BOI15_hac)	C++14	100 / 100	109 ms	6976 KB

#include <bits/stdc++.h>
using namespace std;
int n;
int sum = 0;
int a[500005],b[500005];
deque <int> dq;
int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]), sum += a[i];
    for(int i=0;i<n/2;i++)
        b[0] += a[i];
    for(int i=1;i<n;i++)
        b[i] = b[i-1] - a[i-1] + a[(i+n/2-1+n)%n];
    for(int i=1;i<=n/2 + (n%2==1);i++){
        if (!dq.size()) dq.push_back(i);
        else{
            while(dq.size() && b[dq.back()] < b[i]) dq.pop_back();
            dq.push_back(i);
        }
    }

    int ans = 0;
    for(int i=0;i<n;i++){
        if (dq.front() == i) dq.pop_front();
        //cout << b[dq.front()] << endl;
        ans = max(ans, sum - b[dq.front()]);


        while(dq.size() && b[dq.back()] < b[(i+n/2 + (n%2==1)+1)%n]) dq.pop_back();
            dq.push_back((i+n/2 + (n%2==1)+1)%n);
    }
    cout << ans;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:8:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
hac.cpp:10:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]), sum += a[i];
                                       ^

Subtask #1
20.0 / 20.0

#	결과	메모리	Grader output
1	Correct	5920 KB	Output is correct
2	Correct	5920 KB	Output is correct
3	Correct	5920 KB	Output is correct
4	Correct	5920 KB	Output is correct
5	Correct	5920 KB	Output is correct
6	Correct	5920 KB	Output is correct
7	Correct	5920 KB	Output is correct
8	Correct	5920 KB	Output is correct
9	Correct	5920 KB	Output is correct
10	Correct	5920 KB	Output is correct
11	Correct	5920 KB	Output is correct
12	Correct	5920 KB	Output is correct
13	Correct	5920 KB	Output is correct
14	Correct	5920 KB	Output is correct
15	Correct	5920 KB	Output is correct
16	Correct	5920 KB	Output is correct
17	Correct	5920 KB	Output is correct
18	Correct	5920 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5920 KB	Output is correct
2	Correct	0 ms	5920 KB	Output is correct
3	Correct	0 ms	5920 KB	Output is correct
4	Correct	13 ms	5920 KB	Output is correct
5	Correct	43 ms	5920 KB	Output is correct
6	Correct	46 ms	5920 KB	Output is correct
7	Correct	66 ms	5920 KB	Output is correct
8	Correct	106 ms	5920 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5920 KB	Output is correct
2	Correct	0 ms	5920 KB	Output is correct
3	Correct	0 ms	5920 KB	Output is correct
4	Correct	0 ms	5920 KB	Output is correct
5	Correct	0 ms	5920 KB	Output is correct
6	Correct	0 ms	5920 KB	Output is correct
7	Correct	0 ms	5920 KB	Output is correct
8	Correct	0 ms	5920 KB	Output is correct
9	Correct	0 ms	5920 KB	Output is correct
10	Correct	0 ms	5920 KB	Output is correct
11	Correct	0 ms	5920 KB	Output is correct
12	Correct	0 ms	5920 KB	Output is correct
13	Correct	0 ms	5920 KB	Output is correct
14	Correct	0 ms	5920 KB	Output is correct
15	Correct	0 ms	5920 KB	Output is correct
16	Correct	0 ms	5920 KB	Output is correct
17	Correct	0 ms	5920 KB	Output is correct
18	Correct	0 ms	5920 KB	Output is correct
19	Correct	0 ms	5920 KB	Output is correct
20	Correct	0 ms	5920 KB	Output is correct
21	Correct	0 ms	5920 KB	Output is correct
22	Correct	0 ms	5920 KB	Output is correct
23	Correct	0 ms	5920 KB	Output is correct
24	Correct	0 ms	5920 KB	Output is correct
25	Correct	0 ms	5920 KB	Output is correct
26	Correct	0 ms	5920 KB	Output is correct
27	Correct	0 ms	5920 KB	Output is correct
28	Correct	0 ms	5920 KB	Output is correct
29	Correct	0 ms	5920 KB	Output is correct
30	Correct	0 ms	5920 KB	Output is correct
31	Correct	0 ms	5920 KB	Output is correct
32	Correct	0 ms	5920 KB	Output is correct
33	Correct	0 ms	5920 KB	Output is correct
34	Correct	0 ms	5920 KB	Output is correct
35	Correct	13 ms	5920 KB	Output is correct
36	Correct	43 ms	5920 KB	Output is correct
37	Correct	46 ms	5920 KB	Output is correct
38	Correct	66 ms	5920 KB	Output is correct
39	Correct	106 ms	5920 KB	Output is correct
40	Correct	0 ms	5920 KB	Output is correct
41	Correct	3 ms	5920 KB	Output is correct
42	Correct	3 ms	5920 KB	Output is correct
43	Correct	33 ms	5920 KB	Output is correct
44	Correct	103 ms	5920 KB	Output is correct
45	Correct	16 ms	5920 KB	Output is correct
46	Correct	69 ms	5920 KB	Output is correct
47	Correct	109 ms	5920 KB	Output is correct
48	Correct	73 ms	6976 KB	Output is correct
49	Correct	93 ms	6976 KB	Output is correct
50	Correct	86 ms	6976 KB	Output is correct

답안 #31575

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 40.0 / 40.0

Subtask #1
20.0 / 20.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
40.0 / 40.0