hdu 3033-分组背包

题目链接：点击打开链接

题解思路：dp[i][j]几种品牌的鞋，金币不超过j的最大价值

代码：

#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<queue>#define lson l,mid,rt<<1#define rson mid+1,r,rt<<1|1#define inf 0x3f3f3f3fusing namespace std;typedef long long ll;const int mx =1e4+10;int n,m,q,num[15][mx/10],val[15][mx/10];int dp[mx][15];int main(){    while(~scanf("%d%d%d",&n,&m,&q)){        int x,y,z;        for(int i=1;i<=q;i++) num[i][0] = 0;        for(int i = 0;i < n;i ++ ){            scanf("%d%d%d",&x,&y,&z);            num[x][++num[x][0]] = y;            val[x][num[x][0]] = z;        }                for(int i=0;i<=m;i++)        for(int j=1;j<=q;j++) dp[i][j] = -inf;                for(int i=1;i<=q;i++){            for(int j=1;j<=num[i][0];j++){                for(int k=m;k>=num[i][j];k--)                 dp[k][i] = max(dp[k][i],max(dp[k-num[i][j]][i]+val[i][j],dp[k-num[i][j]][i-1]+val[i][j]));            }        }        if(dp[m][q]<0) puts("Impossible");        else printf("%d\n",dp[m][q]);    }    return 0;}