hdu4501（多维背包）

题意：多维背包

思路：dp[i][j][k][o]表示前i件物品，花了j元，花了k个积分，拿了o个免费品的最优值，状态转移见代码。

代码如下：

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>

#define N 105
using namespace std;
int dp[N][N][N][6];
struct node
{
    int a,b,val;
}s[N];

int main()
{
    int n,v1,v2,num;
    while(scanf("%d%d%d%d",&n,&v1,&v2,&num) != EOF)
    {
        int i,j,k;
        for(i = 1; i <= n; i++)
            scanf("%d%d%d",&s[i].a,&s[i].b,&s[i].val);
        memset(dp,0,sizeof(dp));
        for(i = 1; i <= n; i++)
            for(j = 0; j <= v1; j++)
                for(k = 0; k <= v2; k++)
                    for(int o = 0; o <= num; o++)
                    {
                        if(j-s[i].a >= 0 && dp[i][j][k][o] < dp[i-1][ j- s[i].a ][k][o] + s[i].val)
                            dp[i][j][k][o] = dp[i-1][j- s[i].a ][k][o] + s[i].val;

                        if(k-s[i].b >= 0&& dp[i][j][k][o] < dp[i-1][j][k- s[i].b ][o] + s[i].val)
                            dp[i][j][k][o] = dp[i-1][j][k- s[i].b ][o] + s[i].val;

                        if( o-1 >= 0 && dp[i][j][k][o] < dp[i-1][j][k][o-1] + s[i].val )
                            dp[i][j][k][o] = dp[i-1][j][k][o-1] + s[i].val;

                        dp[i][j][k][o] = max(dp[i][j][k][o],dp[i-1][j][k][o]);//不要漏掉这种情况

                    }
       printf("%d\n",dp[n][v1][v2][num]);
    }
    return 0;
}
/*
5 1 6 5
4 3 3
0 3 2
2 3 3
3 3 2
1 0 2
4 2 5 0
0 1 0
4 4 1
3 3 4
3 4 4
*/