Submission #1289156

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289156		naneosmic	Feast (NOI19_feast)	C++20	18 / 100	970 ms	23864 KiB

feast

#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
int n,k;
vector<int>a;
pair<int,int>calc(int lambda){
    vector<vector<pair<int,int>>>dp(n,vector<pair<int,int>>(2));
    dp[0][0]={0,0};
    dp[0][1]={a[0]-lambda,1};
    for(int i=1;i<n;i++){
        dp[i][0]=max(dp[i-1][0],dp[i-1][1]);
        dp[i][1]=max(make_pair(dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1),make_pair(dp[i-1][1].first+a[i],dp[i-1][1].second));
    }
    return max(dp[n-1][0],dp[n-1][1]);
}
signed main(){
    cin>>n>>k;
    a.resize(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int l=0,r=1e18;
    pair<int,int>p;
    while(l<r){
        int mid=(l+r+1)/2;
        p=calc(mid);
        if(p.second>=k){
            l=mid;
        }else{
            r=mid-1;
        }
    }
    cout<<p.first+(l*k);
}

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