제출 #950607

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950607		VMaksimoski008	Feast (NOI19_feast)	C++14	100 / 100	321 ms	26952 KiB

feast

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int32_t main() {
    int n, K;
    cin >> n >> K;

    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i];

    ll l=0, r=1e15, ans=0;
    vector<vector<pll> > dp(n+1, vector<pll>(2));

    auto check = [&](int mid) {
        for(int i=0; i<=n; i++)
            for(int j=0; j<2; j++) dp[i][j] = {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]);
            dp[i][1] = max(pll{ dp[i-1][1].first + v[i], dp[i-1][1].second }, pll{ dp[i-1][0].first + v[i] - mid, dp[i-1][0].second + 1 });
        }

        return max(dp[n][0], dp[n][1]).second;
    };

    while(l <= r) {
        ll mid = (l + r) / 2;
        if(check(mid) >= K) ans = mid, l = mid + 1;
        else r = mid - 1;
    }

    check(ans);

    cout << max(dp[n][0], dp[n][1]).first + K * ans << '\n';
    return 0;
}

• 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