思路:多了一种代价,只需要普通背包问题加一维即可
#include<stdio.h>
#define max(a,b) a>b?a:b
int tiji[51],zhiliang[51],kll[51],dp[51][401][401];
int main()
{
int j,k,i,u,y,x,n,m,max,volume,mass,kind;
scanf("%d %d",&volume,&mass);
scanf("%d",&kind);
for(i=1;i<=kind;i++)
{
scanf("%d %d %d",&tiji[i],&zhiliang[i],&kll[i]);
}
for(i=0;i<=kind;i++)
{
for(j=0;j<=volume;j++)
{
for(x=0;x<=mass;x++)
{
if(i==0||j==0||x==0)
{
dp[i][j][x]=0;
}
else if(tiji[i]>j||zhiliang[i]>x)
{
dp[i][j][x]=dp[i-1][j][x];
}
else
{
dp[i][j][x]=max(dp[i-1][j][x],dp[i-1][j-tiji[i]][x-zhiliang[i]]+kll[i]);
}
}
}
}
printf("%d",dp[kind][volume][mass]);
return 0;
}