题目链接http://acm.hdu.edu.cn/showproblem.php?pid=2191
源代码:
#include<iostream>
#include<cstdlib>
#include<cstdio>
using namespace std;
#define N 101
int w[N];
int v[N];
int multiple_pack[N];
int a[N];
int main()
{
int cases;
scanf("%d",&cases);
while(cases--)
{
int n,m,i,j,k;
scanf("%d%d",&n,&m);
memset(multiple_pack,0,sizeof(multiple_pack));
memset(a,0,sizeof(a));
for(i=0;i<m;i++)
scanf("%d%d%d",&v[i],&w[i],&a[i]);
for(i=0;i<m;i++)
for(k=0;k<a[i];k++)
for(j=n;j>=v[i];j--)
{
if(multiple_pack[j]<multiple_pack[j-v[i]]+w[i])
multiple_pack[j]=multiple_pack[j-v[i]]+w[i];
}
printf("%d\n",multiple_pack[n]);
}
return 0;
}