oj.uz

Submission #677195

# Submission time Handle Problem Language Result Execution time Memory
677195 2023-01-02T14:24:58 Z Sandarach151 Feast (NOI19_feast) C++17
0 / 100
 117 ms 262144 KB 
#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]=maxx[i];
		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.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 9340 KB Output is correct
2 Correct 25 ms 9644 KB Output is correct
3 Incorrect 29 ms 9448 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 37 ms 11340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 117 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -