思路:将三维压缩成二维,跟之前背包问题一样,二维01背包采用逆序,完全二维背包就顺序,多重二维背包二进制优化然后变成二维01背包
#include<stdio.h>
#define max(a,b) a>b?a:b
int tiji[51],zhiliang[51],kll[51],dp[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]);
}
tiji[0]=0;
zhiliang[0]=0;
for(i=0;i<=kind;i++)
{
for(j=volume;j>=tiji[i];j--)
{
for(x=mass;x>=zhiliang[i];x--)
{
if(i==0||j==0||x==0)
{
dp[j][x]=0;
}
else
{
dp[j][x]=max(dp[j][x],dp[j-tiji[i]][x-zhiliang[i]]+kll[i]);
}
}
}
}
printf("%d",dp[volume][mass]);
return 0;
}