제출 #1136109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1136109		lopkus	Feast (NOI19_feast)	C++20	100 / 100	128 ms	12104 KiB

feast

#include <bits/stdc++.h>

#define int long long

using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int l = 0, r = 1e18, ans = - 1;
    while(l <= r) {
        int mid = (l + r) / 2;
        pair<int,int> dp[n + 1][2];
        dp[0][0] = {0, 0};
        dp[0][1] = {-1e18, 0};
        for(int i = 1; i <= n; i++) {
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
            pair<int,int> best1;
            pair<int,int> best2;
            best1 = {dp[i - 1][0].first + a[i] - mid, dp[i - 1][0].second - 1};
            best2 = {dp[i - 1][1].first + a[i], dp[i - 1][1].second};
            dp[i][1] = max(best1, best2);
        }
        pair<int,int> e = max(dp[n][0], dp[n][1]);
        if(-e.second <= k) {
            r = mid - 1;
            ans = mid * (-e.second) + e.first;
        }
        else {
            l = mid + 1;
        }
    }
    cout << ans;
}

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