제출 #1211358

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1211358		minglaga	Feast (NOI19_feast)	C++20	0 / 100	1096 ms	4300 KiB

feast

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 3e5 + 5;
ll a[maxn], dp[maxn], prefix[maxn];
int n, k;

pair<ll, int> alien(ll s) {
    dp[0] = 0;
    vector<int> cnt(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        dp[i] = dp[i - 1];
        cnt[i] = cnt[i - 1];

        ll total = 0;
        for (int j = i; j >= 1; j--) {
            total += a[j];
            if (dp[j - 1] + total - s > dp[i]) {
                dp[i] = dp[j - 1] + total - s;
                cnt[i] = cnt[j - 1] + 1;
            }
        }
    }

    return {dp[n] + k * s, cnt[n]};
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];

    ll l = -1e9, r = 1e9, ans = LLONG_MIN;

    while (l <= r) {
        ll m = (l + r) / 2;
        auto [val, cnt_seg] = alien(m);
        if (cnt_seg > k)
            l = m + 1;
        else {
            ans = val;
            r = m - 1;
        }
    }

    cout << ans << '\n';
}

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