oj.uz

답안 #31582

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31582 2017-08-30T01:55:52 Z ngkan146 Hacker (BOI15_hac) C++
60 / 100
 86 ms 7876 KB 
#include <bits/stdc++.h>
using namespace std;
int n;
int sum = 0;
int a[500005],b[500005];
int dq[500005], dqfront,dqback;
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 (dqfront==dqback) dq[dqback++] = i;
        else{
            while(dqfront < dqback && b[dq[dqback-1]] < b[i]) --dqback;
            dq[dqback++]=i;
        }
    }

    int ans = 0;
    for(int i=0;i<n;i++){
        if (dq[dqfront] == i) dqfront++;
        ans = max(ans, sum - b[dq[dqfront]]);
        while(dqfront < dqback && b[dq[dqback-1]] < b[(i+n/2 + (n%2==1)+1)%n]) --dqback;
            dq[dqback++]=(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 0 ms 7876 KB Output is correct
2 Correct 0 ms 7876 KB Output is correct
3 Correct 0 ms 7876 KB Output is correct
4 Correct 0 ms 7876 KB Output is correct
5 Correct 0 ms 7876 KB Output is correct
6 Correct 0 ms 7876 KB Output is correct
7 Correct 0 ms 7876 KB Output is correct
8 Correct 0 ms 7876 KB Output is correct
9 Correct 0 ms 7876 KB Output is correct
10 Correct 0 ms 7876 KB Output is correct
11 Correct 0 ms 7876 KB Output is correct
12 Correct 0 ms 7876 KB Output is correct
13 Correct 0 ms 7876 KB Output is correct
14 Correct 0 ms 7876 KB Output is correct
15 Correct 0 ms 7876 KB Output is correct
16 Correct 0 ms 7876 KB Output is correct
17 Correct 0 ms 7876 KB Output is correct
18 Correct 0 ms 7876 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7876 KB Output is correct
2 Correct 0 ms 7876 KB Output is correct
3 Correct 0 ms 7876 KB Output is correct
4 Correct 9 ms 7876 KB Output is correct
5 Correct 33 ms 7876 KB Output is correct
6 Correct 36 ms 7876 KB Output is correct
7 Correct 59 ms 7876 KB Output is correct
8 Correct 79 ms 7876 KB Output is correct

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 7876 KB Output is correct
2 Correct 0 ms 7876 KB Output is correct
3 Correct 0 ms 7876 KB Output is correct
4 Correct 0 ms 7876 KB Output is correct
5 Correct 0 ms 7876 KB Output is correct
6 Correct 0 ms 7876 KB Output is correct
7 Correct 0 ms 7876 KB Output is correct
8 Correct 0 ms 7876 KB Output is correct
9 Correct 0 ms 7876 KB Output is correct
10 Correct 0 ms 7876 KB Output is correct
11 Correct 0 ms 7876 KB Output is correct
12 Correct 0 ms 7876 KB Output is correct
13 Correct 0 ms 7876 KB Output is correct
14 Correct 0 ms 7876 KB Output is correct
15 Correct 0 ms 7876 KB Output is correct
16 Correct 0 ms 7876 KB Output is correct
17 Correct 0 ms 7876 KB Output is correct
18 Correct 0 ms 7876 KB Output is correct
19 Correct 0 ms 7876 KB Output is correct
20 Correct 0 ms 7876 KB Output is correct
21 Correct 0 ms 7876 KB Output is correct
22 Correct 0 ms 7876 KB Output is correct
23 Correct 0 ms 7876 KB Output is correct
24 Correct 0 ms 7876 KB Output is correct
25 Correct 0 ms 7876 KB Output is correct
26 Correct 0 ms 7876 KB Output is correct
27 Correct 0 ms 7876 KB Output is correct
28 Correct 0 ms 7876 KB Output is correct
29 Correct 0 ms 7876 KB Output is correct
30 Correct 0 ms 7876 KB Output is correct
31 Correct 0 ms 7876 KB Output is correct
32 Correct 0 ms 7876 KB Output is correct
33 Correct 0 ms 7876 KB Output is correct
34 Correct 0 ms 7876 KB Output is correct
35 Correct 9 ms 7876 KB Output is correct
36 Correct 33 ms 7876 KB Output is correct
37 Correct 36 ms 7876 KB Output is correct
38 Correct 59 ms 7876 KB Output is correct
39 Correct 79 ms 7876 KB Output is correct
40 Correct 0 ms 7876 KB Output is correct
41 Correct 3 ms 7876 KB Output is correct
42 Correct 3 ms 7876 KB Output is correct
43 Correct 33 ms 7876 KB Output is correct
44 Correct 79 ms 7876 KB Output is correct
45 Correct 16 ms 7876 KB Output is correct
46 Correct 53 ms 7876 KB Output is correct
47 Correct 86 ms 7876 KB Output is correct
48 Incorrect 59 ms 7876 KB Output isn't correct
49 Halted 0 ms 0 KB -