oj.uz

Submission #723648

# Submission time Handle Problem Language Result Execution time Memory
723648 2023-04-14T07:01:40 Z kas_s Hacker (BOI15_hac) C++17
0 / 100
 1 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);
    long long s = 0;
    for (int &v: a) {
        cin >> v;
        s += v;
    }
    for (int i = 0; i < N; i++) a.push_back(a[i]);
    long long res = 0;
    for (int i = 0; i < N; i++) {
        int len = (N + 1) / 2;
        long long window = 0;
        for (int j = 0; j < len; j++) window += a[j];
        long long best = 0,
                  sec = 0;
        for (int r = len; r < N + N; r++) {
            window += a[r];
            window -= a[r - len];
            if ((r >= i + N && r - len + 1 <= i + N)) {
                if (best < window) {
                    sec = best;
                    best = window;
                } else if (sec < window) {
                    sec = window;
                }
            }
        }
        res = max(res, sec);
    }
    cout << res;
    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 40.0

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