제출 #902467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
902467		thinknoexit	Feast (NOI19_feast)	C++17	30 / 100	80 ms	10488 KiB

feast

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int a[300300], n;
ll qs[300300];
ll dp[300300];
int cnt[300300];
void cal(ll mid) {
    pair<ll, int> mx(0ll, 0);
    for (int i = 1;i <= n;i++) {
        dp[i] = dp[i - 1];
        cnt[i] = cnt[i - 1];
        if (qs[i] + mx.first - mid > dp[i]) {
            dp[i] = qs[i] + mx.first - mid;
            cnt[i] = mx.second + 1;
        }
        mx = max(mx, { dp[i] - qs[i], cnt[i] });
    }
}
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int k;
    cin >> n >> k;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        qs[i] = qs[i - 1] + a[i];
    }
    ll l = -1e13, r = 1e13;
    while (l < r) {
        ll mid = l + (r - l + 1) / 2;
        cal(mid);
        if (cnt[n] >= k) l = mid;
        else r = mid - 1;
    }
    cal(l);
    cout << dp[n] + l * k;
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 18 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11
• Subtask 6: 0 / 20
• Subtask 7: 0 / 29