답안 #914561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
914561	2024-01-22T10:36:52 Z	Ghetto	Hacker (BOI15_hac)	C++17	40 / 100	85 ms	5876 KB

hac

#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 5e5 + 5;

int n;
int arr[MAX_N];

int segtree[MAX_N];
void update(int i, int x, int u = 1, int lo = 1, int hi = n) {
    if (lo == hi) {
        segtree[u] = x;
        return;
    }

    int mid = (lo + hi) / 2;
    if (i <= mid)
        update(i, x, 2 * u, lo, mid);
    else
        update(i, x, 2 * u + 1, mid + 1, hi);
    segtree[u] = max(segtree[2 * u], segtree[2 * u + 1]);
}
int query(int l, int r, int u = 1, int lo = 1, int hi = n) {
    if (l <= lo && hi <= r)
        return segtree[u];
    
    int mid = (lo + hi) / 2, ans = 0; // arr[i] >= 1
    if (l <= mid) 
        ans = max(ans, query(l, r, 2 * u, lo, mid));
    if (r > mid)
        ans = max(ans, query(l, r, 2 * u + 1, mid + 1, hi));
    return ans;
}

int subarray_sum[MAX_N];
int tot_sum;
void precomp() {
    int s = n / 2;

    for (int i = 1; i <= s; i++)
        subarray_sum[1] += arr[i];
    for (int i = 2; i <= n; i++) {
        int j = i + s - 1;
        if (j > n) 
            j -= n;
        subarray_sum[i] = subarray_sum[i - 1] - arr[i - 1] + arr[j];
        // cout << subarray_sum[i] << " ";
    }
    for (int i = 1; i <= n; i++)
        update(i, subarray_sum[i]);
    
    for (int i = 1; i <= n; i++)
        tot_sum += arr[i];
}

int main() {
    // freopen("hacker.in", "r", stdin);

    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> arr[i];
    
    precomp();
    
    int s = n / 2;
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        int j = i - s;
        if (j >= 1)
            ans = max(ans, tot_sum - max(query(i + 1, n), query(1, j)));
        else {
            j += n;
            ans = max(ans, tot_sum - query(i + 1, j));
        }
    }
    cout << ans << '\n';
}

Subtask #1

20.0 / 20.0

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

Subtask #2

20.0 / 20.0

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

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	2 ms	4444 KB	Output is correct
3	Correct	3 ms	4696 KB	Output is correct
4	Correct	44 ms	5048 KB	Output is correct
5	Incorrect	85 ms	5876 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #4

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4440 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4440 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	2 ms	4440 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Correct	1 ms	4444 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	1 ms	4444 KB	Output is correct
18	Correct	1 ms	4444 KB	Output is correct
19	Correct	2 ms	4440 KB	Output is correct
20	Correct	2 ms	4444 KB	Output is correct
21	Correct	2 ms	4444 KB	Output is correct
22	Correct	2 ms	4444 KB	Output is correct
23	Correct	3 ms	4440 KB	Output is correct
24	Correct	2 ms	4444 KB	Output is correct
25	Correct	3 ms	4444 KB	Output is correct
26	Correct	3 ms	4440 KB	Output is correct
27	Correct	2 ms	4440 KB	Output is correct
28	Correct	1 ms	4440 KB	Output is correct
29	Correct	1 ms	4444 KB	Output is correct
30	Correct	3 ms	4584 KB	Output is correct
31	Correct	3 ms	4440 KB	Output is correct
32	Correct	1 ms	4440 KB	Output is correct
33	Correct	2 ms	4444 KB	Output is correct
34	Correct	3 ms	4696 KB	Output is correct
35	Correct	44 ms	5048 KB	Output is correct
36	Incorrect	85 ms	5876 KB	Output isn't correct
37	Halted	0 ms	0 KB	-