제출 #1290892

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290892		escobrand	Feast (NOI19_feast)	C++20	100 / 100	83 ms	12144 KiB

feast

#include <bits/stdc++.h>

using namespace std;
#define all(v) v.begin(),v.end()
#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define mk make_pair
typedef pair<ll,ll> pii;

const int maxn = 3e5 + 10;
const ll inf = 1e17;
ll a[maxn];
pii dp[maxn][2];
int n,k;
pii cal(ll cost)
{
    for(int i = 1;i<=n;i++)
    {
        dp[i][0] = max(dp[i-1][0],dp[i-1][1]);
        dp[i][1] = max( mk(dp[i-1][0].fi + a[i] - cost,dp[i-1][0].se+1),
                        mk(dp[i-1][1].fi + a[i], dp[i-1][1].se ));
    }
    return max(dp[n][0],dp[n][1]);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    dp[0][1] = mk(-inf,0);
    
    cin>>n>>k;
    
    for(int i = 1;i<=n;i++)cin>>a[i];
    
    ll l = 0,r = 1e13;
    
    while(l<r)
    {
        ll mid = (l + r + 1)/2;
        pii ans = cal(mid);
        if(ans.se>k)l=mid;
        else r = mid-1;
    }
    
    pii ans = cal(++l);
    cout<<ans.fi + l*ans.se;
    
    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