Submission #1173471

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173471		ezzzay	Feast (NOI19_feast)	C++20	0 / 100	1 ms	324 KiB

feast

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=4000;
int a[N];
int n,k;
pair<int,int> fun(int lmd){
    pair<int,int>dp[N][2];
    for(int i=0;i<N;i++){
        for(int j=0;j<2;j++)dp[i][j]={0,0};
    }
    dp[1][0]={0,0};
    dp[1][1]= {a[1]-lmd,1};
    for(int i=2;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].ff+a[i] - lmd, dp[i - 1][0].second + 1),
			        make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second));
    }
    return max({dp[n][0],dp[n][1]});
}
signed main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i];
    int hi=1e18;
    int lo=0;
    while(hi>=lo){
        int mid=(hi+lo)/2;
        fun(mid).ss>= k ? lo=mid+1 : hi=mid-1;
    }
	cout << max(0ll,fun(hi).first + hi * k) << endl;
}

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