제출 #1201699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1201699		12345678	Feast (NOI19_feast)	C++17	30 / 100	72 ms	9800 KiB

feast

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll nx=3e5+5, inf=1e15;

ll n, k, a[nx], qs[nx], l=0, r=inf;

pair<ll, ll> solve(ll x)
{
    pair<ll, ll> mx, dp[n+1];
    for (int i=1; i<=n; i++)
    {
        dp[i]=max(dp[i-1], {mx.first+qs[i]-x, mx.second-1});
        mx=max(mx, {dp[i].first-qs[i], dp[i].second-1});
    }
    return dp[n];
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>a[i], qs[i]=qs[i-1]+a[i];
    while (l<r)
    {
        ll md=(l+r)/2;
        if (-solve(md).second<=k) r=md;
        else l=md+1;
    }
    //cout<<"debug "<<l<<' '<<solve(l).first<<' '<<-solve(l).second<<'\n';
    cout<<solve(l).first+k*l;
}

• 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