oj.uz

Submission #723570

# Submission time Handle Problem Language Result Execution time Memory
723570 2023-04-14T05:24:14 Z kas_s Hacker (BOI15_hac) C++17
0 / 100
 0 ms 212 KB 
#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;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 40.0

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