oj.uz

Submission #31675

# Submission time Handle Problem Language Result Execution time Memory
31675 2017-08-30T15:43:11 Z Dat160601 Hacker (BOI15_hac) C++14
100 / 100
 183 ms 10884 KB 
#include <bits/stdc++.h>
using namespace std;
int n,a[1000007],pre[1000007],ans=0;
deque <int> cur;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        a[n+i]=a[i];
    }
    int sz=(n/2)+(n%2);
    for(int i=1;i<=sz;i++){
        pre[1]+=a[i];
    }
    for(int i=2;i<=n;i++){
        pre[i]=pre[i-1]+a[i+sz-1]-a[i-1];
    }
    for(int i=1;i<=n;i++) pre[n+i]=pre[i];
    for(int i=1;i<=2*n;i++){
        while(!cur.empty() && pre[cur.back()]>=pre[i]) cur.pop_back();
        cur.push_back(i);
        if(i-cur.front()==sz) cur.pop_front();
        if(i>=sz) ans=max(ans,pre[cur.front()]);
    }
    cout<<ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9828 KB Output is correct
2 Correct 0 ms 9828 KB Output is correct
3 Correct 0 ms 9828 KB Output is correct
4 Correct 29 ms 9828 KB Output is correct
5 Correct 76 ms 9828 KB Output is correct
6 Correct 76 ms 9828 KB Output is correct
7 Correct 116 ms 9828 KB Output is correct
8 Correct 183 ms 9828 KB Output is correct

Subtask #4
40.0 / 40.0

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