MLE 92求跳
查看原帖
MLE 92求跳
539712
123uuu楼主2024/3/15 12:42
#include<bits/stdc++.h>
using namespace std;
int mp[5000][10000], a[50000];
int main(){
	int m, n, i, j;
	cin >> m >> n;
	for(int i = 1; i <= n; ++i){
		cin >> a[i];
	}
	for(i = 1; i <= n; ++i){
		for(j = 1; j <= m; ++j){
			mp[i][j] = mp[i - 1][j];
			if (a[i] <= j){
				mp[i][j] = max(mp[i - 1][j], mp[i - 1][j - a[i]] + a[i]);
			}
			
		}
	}
	cout << mp[n][m];
return 0;
} 

2024/3/15 12:42
加载中...