oj.uz

답안 #723601

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723601 2023-04-14T06:03:35 Z Mr_Husanboy Hacker (BOI15_hac) C++17
100 / 100
 367 ms 14344 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int inf = 1e9;


void solve(){
    int n; cin >> n;
    vector<int> p(n);
    for(int i = 0; i < n; i ++) cin >> p[i];
    int ans = 0;
    for(int i = 1; i < n; i ++){
        p[i] += p[i - 1];
    }
    auto get = [&](int l, int r)->int{
        if(l > r){
            return p[r] + p[n - 1] - (l ? p[l - 1] : 0);
        }
        return p[r] - (l ? p[l - 1] : 0);
    };
    multiset<int> st;
    int k = (n + 1) / 2;
    for(int i = 0; i < n; i ++){
        for(int j = i; j < i + k; j ++){
            int r = j % n;
            int l = ((r - k + 1) % n + n) % n;
            st.insert(get(l, r));
        }
        ans = max(ans, *st.begin());
        break;
    }
    for(int i = 1; i < n; i ++){
        int del = get(((i - k) % n + n) % n, i - 1);
        int add = get(i, (i + k - 1) % n);
        //cout << del << ' ' << add << endl;
        st.erase(st.find(del));

        st.insert(add);
        ans = max(ans, *st.begin());
    }
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int testcases = 1;

    while(testcases --){
        solve();
        if(testcases) cout << '\n';
        #ifdef LOCAL
        else cout << '\n';
        cout << "__________________________" << endl;
        #endif
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 456 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 30 ms 2772 KB Output is correct
5 Correct 85 ms 6428 KB Output is correct
6 Correct 148 ms 7496 KB Output is correct
7 Correct 141 ms 8908 KB Output is correct
8 Correct 367 ms 14316 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 456 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 30 ms 2772 KB Output is correct
36 Correct 85 ms 6428 KB Output is correct
37 Correct 148 ms 7496 KB Output is correct
38 Correct 141 ms 8908 KB Output is correct
39 Correct 367 ms 14316 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 9 ms 844 KB Output is correct
42 Correct 12 ms 1316 KB Output is correct
43 Correct 102 ms 6084 KB Output is correct
44 Correct 268 ms 14304 KB Output is correct
45 Correct 51 ms 3280 KB Output is correct
46 Correct 142 ms 8852 KB Output is correct
47 Correct 307 ms 14344 KB Output is correct
48 Correct 228 ms 14296 KB Output is correct
49 Correct 218 ms 14288 KB Output is correct
50 Correct 207 ms 14288 KB Output is correct