oj.uz

Submission #31592

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

deque <long long> mq;
long long n, a[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 <= siz; i++) sum[1] += a[i];
    for (int i = 2; i <= n; i++){
        int z = i-1+siz; if (z > n) z -= n;
        sum[i] = sum[i-1] + a[z] - 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();
        maxx = max(sum[mq.back()], maxx);
    }
    cout << maxx;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13732 KB Output is correct
2 Correct 0 ms 13732 KB Output is correct
3 Incorrect 0 ms 13732 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13732 KB Output is correct
2 Correct 0 ms 13732 KB Output is correct
3 Incorrect 0 ms 13732 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13732 KB Output is correct
2 Incorrect 0 ms 13732 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 13732 KB Output is correct
2 Correct 0 ms 13732 KB Output is correct
3 Incorrect 0 ms 13732 KB Output isn't correct
4 Halted 0 ms 0 KB -