oj.uz

답안 #884627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884627 2023-12-07T19:00:17 Z MisterReaper Hacker (BOI15_hac) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

#define ONLINE_JUDGE
void solve() {
    int n;
    cin >> n;

    vector <int> a(2 * n +1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i + n] = a[i];
    }

    vector <int> pref = a;
    for(int i = 1; i <= 2 * n; i++) {
        pref[i] += pref[i -1];
    }

    auto get = [&](int x, int y) -> int {
        return pref[x] - pref[y -1];
    };

    int ans = 0, sz = (n +1) / 2;
    multiset <int> ms;
    for(int i = 1; i <= 2 * n; i++) {
        if(i + sz -1 <= 2 * n) {
            ms.emplace(get(i + sz -1, i));
        }
        if(i - sz >= 1) {
            ms.erase(ms.find(get(i -1, i - sz)));
        }

        /*
        cerr << i << ":\n";
        for(const int &j : ms) {
            cerr << j << " ";
        }
        cerr << "\n";
        */
        
        ans = max(ans, *ms.begin());
    }

    cout << ans;
    
    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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

# 결과 실행 시간 메모리 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 -