Submission #31598

#	Time	Username	Problem	Language	Result	Execution time	Memory
31598		minhtung0404	Hacker (BOI15_hac)	C++14	0 / 100	0 ms	17640 KiB

hac

#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 <= 2*n; i++) a[i] = a[i-1] + a[i];
    for (int i = siz; i <= 2*n; i++) sum[i] = a[i] - a[i-siz];
    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: 0 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 40