제출 #986134

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
986134		andrei_iorgulescu	Hacker (BOI15_hac)	C++14	100 / 100	296 ms	74268 KiB

hac

#include <bits/stdc++.h>

using namespace std;

int n,a[500005],sp[500005],k;
vector<int> adg[500005],del[500005];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n;
    k = n / 2 + n % 2;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        sp[i] = sp[i - 1] + a[i];
    for (int i = 1; i <= n; i++)
    {
        if (i + k - 1 <= n)
        {
            int vl = sp[i + k - 1] - sp[i - 1];
            adg[i].push_back(vl);
            del[i + k].push_back(vl);
        }
        else
        {
            int vl = sp[n] - sp[i - 1] + sp[i + k - 1 - n];
            adg[i].push_back(vl);
            adg[1].push_back(vl);
            del[i + k - n].push_back(vl);
        }
    }
    multiset<int> ms;
    int mxm = 0;
    for (int i = 1; i <= n; i++)
    {
        for (auto it : adg[i])
            ms.insert(it);
        for (auto it : del[i])
            ms.erase(ms.find(it));
        mxm = max(mxm,*ms.begin());
    }
    cout << mxm;
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 40 / 40