Submission #677197

#	Time	Username	Problem	Language	Result	Execution time	Memory
677197		Sandarach151	Feast (NOI19_feast)	C++17	18 / 100	102 ms	262144 KiB

feast

#include<bits/stdc++.h>
using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, k;
	cin >> n >> k;
	long long int arr[n];
	int prev[n];
	long long int maxx[n];
	long long int ans[k][n];
	for(int i=0; i<n; i++){
		cin >> arr[i];
	}
	maxx[0]=max(arr[0], (long long) 0);
	ans[0][0]=maxx[0];
	prev[0]=-1;
	for(int i=1; i<n; i++){
		maxx[i]=max(maxx[i-1]+arr[i], (long long) 0);
		ans[0][i]=max(maxx[i], ans[0][i-1]);
		if(maxx[i-1]+arr[i]>0){
			prev[i]=prev[i-1];
		}
		else{
			prev[i]=i-1;
		}
	}
	for(int i=1; i<k; i++){
		for(int j=0; j<n; j++){
			if(prev[j]!=-1){
				ans[i][j]=max(maxx[j]+ans[i-1][prev[j]], ans[i][j-1]);
			}
			else{
				ans[i][j]=max(maxx[j], ans[i][j-1]);
			}
		}
	}
	cout << ans[k-1][n-1] << '\n';
	return 0;
}

• 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