【BZOJ3407】[Usaco2009 Oct]Bessie's Weight Problem 贝茜的体重问题【01背包】

【题目链接】

...

/* Pigonometry */
#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 505, maxm = 45005;

int n, m, w[maxn], dp[maxm];

inline int iread() {
	int f = 1, x = 0; char ch = getchar();
	for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
	for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
	return f * x;
}

int main() {
	m = iread(); n = iread();
	for(int i = 1; i <= n; i++) w[i] = iread();

	for(int i = 1; i <= n; i++) for(int j = m; j >= w[i]; j--)
		dp[j] = max(dp[j], dp[j - w[i]] + w[i]);

	printf("%d\n", dp[m]);
	return 0;
}