hdu 2191 多重背包 动态规划

主要思想是把同一种的k个物品转化为k个编号不同的物品，然后用01背包来做。

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;

const int INF = 1000000000;
int dp[1000000], v[100000], w[100000];

int main()
{
	//freopen("ztest.txt","r",stdin);
	int t;
	scanf("%d", &t);
	while(t--)
	{
		int sum, n;
		scanf("%d%d", &sum, &n);
		int all = 1;
		int value, weight, num;
		for(int i = 0; i < n; i++)
		{
			scanf("%d%d%d", &value, &weight, &num);
			for(int j = 0; j < num; j++)
			{
				v[all] = value;
				w[all++] = weight;
			}
		}
		memset(dp, 0, sizeof(dp));
		for(int i = 1; i < all; i++)
		for(int j = sum; j >= v[i]; j--)
			dp[j] = max(dp[j], dp[j-v[i]]+w[i]);
		printf("%d\n",dp[sum]);
	}
	return 0;
}