oj.uz

Submission #917376

# Submission time Handle Problem Language Result Execution time Memory
917376 2024-01-28T03:50:19 Z theghostking Hacker (BOI15_hac) C++17
0 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
    int n;
    cin >> n;
    vector<int> a(3*n);
    for (int i = 0; i<n; i++){
        cin >> a[i];
        a[n+i] = a[i];
        a[n+n+i] = a[i];
    }
    int N = 3*n;
    vector<int> pref(N+1);
    for (int i = 1; i<=N; i++){
        pref[i] = pref[i-1] + a[i-1];
    }
    int tgt = (n+1)/2;
    int ans = 0;
    for (int i = n; i<2*n; i++){
        int one = pref[i+tgt-1]-pref[i-1];
        int two = pref[i]-pref[i-tgt];
        ans = max(ans, min(one,two));
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

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