HDU 4501 小明系列故事——买年货

多维费用背包

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

struct good {
    int a,b,val;
};

int main(){
    int n,v1,v2,k;
    while(cin >> n>>v1>>v2>>k){
        vector<good> commodity(n);
        for(int i = 0; i < n; i ++ )
            cin >> commodity[i].a>>commodity[i].b>>commodity[i].val;
        int dp[105][105][6] ={0};
        for(int i = 0; i <n; i ++ ){
            for(int j = v1; j >= 0; j-- ){
                for(int s = v2; s >= 0; s --){
                    for(int d = k; d >= 0; d -- ){
                        int temp = 0;
                        if(j >= commodity[i].a)
                            temp = max(temp,dp[j-commodity[i].a ][s][d] + commodity[i].val);
                        if(s >= commodity[i].b)
                            temp = max(temp,dp[j][ s-commodity[i].b ][d] + commodity[i].val);
                        if(d >= 1)
                            temp = max(temp,dp[j][s][ d-1 ] + commodity[i].val);
                        dp[j][s][d] = max(temp,dp[j][s][d]);
                    }
                }
            }
        }
        cout<<dp[v1][v2][k]<<endl;
    }
    return 0;
}