Submission #723570

#TimeUsernameProblemLanguageResultExecution timeMemory
723570kas_sHacker (BOI15_hac)C++17
0 / 100
0 ms212 KiB
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int N;
    cin >> N;
    vector<int> a(N);
    for (int &v: a) cin >> v;
    for (auto &v: a) a.push_back(v);
    int len = (N + 1) / 2;
    long long window = 0;
    for (int i = 0; i < len; i++) window += a[i];
    long long best = window,
              sec = 0;
    for (int r = len; r < N + N; r++) {
        window += a[r];
        window -= a[r-len];
        if (window > best) {
            sec = best;
            best = window;
        } else if (window > sec) {
            sec = window;
        }
    }
    cout << sec;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...