|Tyvj|动态规划|P1016 装箱问题

http://tyvj.cn/p/1016

dp01背包题目，价值和体积都是体积

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main () 
{
    const int maxn = 20000 + 5;
    int v,n;
    scanf("%d%d", &v,&n);
    int f[maxn];
    memset(f, 0, sizeof(f));
    for (int i=1;i<=n;i++) 
    {
		int w;
		scanf("%d", &w);
		for (int j=v;j>=0;j--)
		{
			if (j>=w)
		   f[j] = max(f[j], f[j-w]+w);
		}
	}
	printf("%d", v-f[v]);
	return 0;
}