oj.uz

Submission #31603

# Submission time Handle Problem Language Result Execution time Memory
31603 2017-08-30T02:54:24 Z minhtung0404 Hacker (BOI15_hac) C++14
100 / 100
 219 ms 19752 KB 
#include<bits/stdc++.h>
const int N = 5e5 + 5;
using namespace std;

deque <long long> mq;
long long n, a[2*N], sum[2*N], maxx, siz;

int main(){
    cin >> n;
    siz = (n+1)/2;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) a[i+n] = a[i];
    for (int i = 1; i <= siz; i++) sum[1] += a[i];
    for (int i = 2; i <= n; i++) sum[i] = sum[i-1] + a[i-1+siz] - a[i-1];
    for (int i = 1; i <= n; i++) sum[n+i] = sum[i];
    for (int i = 1; i <= 2*n; i++){
        while(mq.size() && sum[mq.front()] >= sum[i]) mq.pop_front();
        mq.push_front(i);
        if (i - mq.back() == siz) mq.pop_back();
        if(i >= siz) maxx = max(sum[mq.back()], maxx);
    }
    cout << maxx;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17640 KB Output is correct
2 Correct 0 ms 17640 KB Output is correct
3 Correct 0 ms 17640 KB Output is correct
4 Correct 0 ms 17640 KB Output is correct
5 Correct 0 ms 17640 KB Output is correct
6 Correct 0 ms 17640 KB Output is correct
7 Correct 0 ms 17640 KB Output is correct
8 Correct 0 ms 17640 KB Output is correct
9 Correct 0 ms 17640 KB Output is correct
10 Correct 0 ms 17640 KB Output is correct
11 Correct 0 ms 17640 KB Output is correct
12 Correct 0 ms 17640 KB Output is correct
13 Correct 0 ms 17640 KB Output is correct
14 Correct 0 ms 17640 KB Output is correct
15 Correct 0 ms 17640 KB Output is correct
16 Correct 0 ms 17640 KB Output is correct
17 Correct 0 ms 17640 KB Output is correct
18 Correct 0 ms 17640 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17640 KB Output is correct
2 Correct 0 ms 17640 KB Output is correct
3 Correct 0 ms 17640 KB Output is correct
4 Correct 0 ms 17640 KB Output is correct
5 Correct 0 ms 17640 KB Output is correct
6 Correct 0 ms 17640 KB Output is correct
7 Correct 0 ms 17640 KB Output is correct
8 Correct 0 ms 17640 KB Output is correct
9 Correct 0 ms 17640 KB Output is correct
10 Correct 0 ms 17640 KB Output is correct
11 Correct 0 ms 17640 KB Output is correct
12 Correct 0 ms 17640 KB Output is correct
13 Correct 0 ms 17640 KB Output is correct
14 Correct 0 ms 17640 KB Output is correct
15 Correct 0 ms 17640 KB Output is correct
16 Correct 0 ms 17640 KB Output is correct
17 Correct 0 ms 17640 KB Output is correct
18 Correct 0 ms 17640 KB Output is correct
19 Correct 0 ms 17640 KB Output is correct
20 Correct 0 ms 17640 KB Output is correct
21 Correct 0 ms 17640 KB Output is correct
22 Correct 0 ms 17640 KB Output is correct
23 Correct 0 ms 17640 KB Output is correct
24 Correct 0 ms 17640 KB Output is correct
25 Correct 0 ms 17640 KB Output is correct
26 Correct 0 ms 17640 KB Output is correct
27 Correct 0 ms 17640 KB Output is correct
28 Correct 0 ms 17640 KB Output is correct
29 Correct 0 ms 17640 KB Output is correct
30 Correct 0 ms 17640 KB Output is correct
31 Correct 0 ms 17640 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17640 KB Output is correct
2 Correct 0 ms 17640 KB Output is correct
3 Correct 0 ms 17640 KB Output is correct
4 Correct 26 ms 17640 KB Output is correct
5 Correct 66 ms 17640 KB Output is correct
6 Correct 83 ms 17640 KB Output is correct
7 Correct 96 ms 17640 KB Output is correct
8 Correct 169 ms 17640 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 17640 KB Output is correct
2 Correct 0 ms 17640 KB Output is correct
3 Correct 0 ms 17640 KB Output is correct
4 Correct 0 ms 17640 KB Output is correct
5 Correct 0 ms 17640 KB Output is correct
6 Correct 0 ms 17640 KB Output is correct
7 Correct 0 ms 17640 KB Output is correct
8 Correct 0 ms 17640 KB Output is correct
9 Correct 0 ms 17640 KB Output is correct
10 Correct 0 ms 17640 KB Output is correct
11 Correct 0 ms 17640 KB Output is correct
12 Correct 0 ms 17640 KB Output is correct
13 Correct 0 ms 17640 KB Output is correct
14 Correct 0 ms 17640 KB Output is correct
15 Correct 0 ms 17640 KB Output is correct
16 Correct 0 ms 17640 KB Output is correct
17 Correct 0 ms 17640 KB Output is correct
18 Correct 0 ms 17640 KB Output is correct
19 Correct 0 ms 17640 KB Output is correct
20 Correct 0 ms 17640 KB Output is correct
21 Correct 0 ms 17640 KB Output is correct
22 Correct 0 ms 17640 KB Output is correct
23 Correct 0 ms 17640 KB Output is correct
24 Correct 0 ms 17640 KB Output is correct
25 Correct 0 ms 17640 KB Output is correct
26 Correct 0 ms 17640 KB Output is correct
27 Correct 0 ms 17640 KB Output is correct
28 Correct 0 ms 17640 KB Output is correct
29 Correct 0 ms 17640 KB Output is correct
30 Correct 0 ms 17640 KB Output is correct
31 Correct 0 ms 17640 KB Output is correct
32 Correct 0 ms 17640 KB Output is correct
33 Correct 0 ms 17640 KB Output is correct
34 Correct 0 ms 17640 KB Output is correct
35 Correct 26 ms 17640 KB Output is correct
36 Correct 66 ms 17640 KB Output is correct
37 Correct 83 ms 17640 KB Output is correct
38 Correct 96 ms 17640 KB Output is correct
39 Correct 169 ms 17640 KB Output is correct
40 Correct 3 ms 17640 KB Output is correct
41 Correct 3 ms 17640 KB Output is correct
42 Correct 9 ms 17640 KB Output is correct
43 Correct 63 ms 17640 KB Output is correct
44 Correct 176 ms 17640 KB Output is correct
45 Correct 29 ms 17640 KB Output is correct
46 Correct 103 ms 17640 KB Output is correct
47 Correct 169 ms 17640 KB Output is correct
48 Correct 219 ms 17640 KB Output is correct
49 Correct 136 ms 19752 KB Output is correct
50 Correct 139 ms 19752 KB Output is correct