제출 #332414

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
332414		keko37	Bigger segments (IZhO19_segments)	C++14	100 / 100	108 ms	24824 KiB

segments

#include<bits/stdc++.h>

using namespace std;

typedef long long llint;
typedef pair <int, int> pi;

const int MAXN = 500005;

int n;
llint a[MAXN], sum[MAXN], best[MAXN], sol[MAXN], mx[MAXN];

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum[i] = a[i] + sum[i - 1];
    }
    for (int i = 1; i <= n; i++) {
        mx[i] = max(mx[i], mx[i - 1]);
        sol[i] = 1 + sol[mx[i]];
        best[i] = sum[i] - sum[mx[i]];
        int ind = lower_bound(sum, sum + n + 1, best[i] + sum[i]) - sum;
        mx[ind] = max(mx[ind], (llint) i);
    }
    cout << sol[n];
    return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 36 / 36
• Subtask 5: 27 / 27