Submission #1161447

#TimeUsernameProblemLanguageResultExecution timeMemory
1161447alexander707070Feast (NOI19_feast)C++20
22 / 100
20 ms4168 KiB
#include<bits/stdc++.h>
#define MAXN 300007
using namespace std;

int n,a[MAXN],k;
long long pref[MAXN],ans;
bool used[MAXN];

int main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin>>n>>k;

	for(int i=1;i<=n;i++){
		cin>>a[i];
		pref[i]=a[i]+pref[i-1];
	}

	for(int i=1;i<=k;i++){
		int last=0,mins=0,l,r;
		long long best=0;

		for(int f=1;f<=n;f++){
			if(used[f]){
				last=f; mins=f;
				continue;
			}else{
				if(pref[f]-pref[mins]>best){
					best=pref[f]-pref[mins];
					l=mins+1; r=f;
				}

				if(pref[f]<pref[mins])mins=f;
			}
		}

		if(best==0)break;

		ans+=best;
		for(int f=l;f<=r;f++)used[f]=true;
	}

	cout<<ans<<"\n";

	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...