Submission #1210078

#	Time	Username	Problem	Language	Result	Execution time	Memory
1210078		nvv	Feast (NOI19_feast)	C++20	100 / 100	182 ms	10972 KiB

feast

#include <bits/stdc++.h>
using namespace std;
int n,k;
pair<long long,long long> sol_lmb(long long lmb,int a[]){
	int i;
	pair<long long,long long> dp[n][2];
	dp[0][0]={0,0};
	dp[0][1]={a[0]-lmb,1};
	for(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]-lmb,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]);
}
int main(){
	int i;
	cin>>n>>k;
	int a[n];
	for(i=0;i<n;++i){
		cin>>a[i];
	}
	long long l=0,r=1000000000000000000,m;
	while(l<r){
		m=(l+r+1)/2;
		sol_lmb(m,a).second>=k?l=m:r=m-1;
	}
	cout<<sol_lmb(l,a).first+l*k;
	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