No.66-LeetCode638-6维dp-选最优套装

起始dp状态是可以7进制压缩的，但是写起来容易错，倒不如这样写好了。

class Solution {
public:
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        const int base = 7;
        int dp[base][base][base][base][base][base];
        memset(dp,0,sizeof(dp));
        int N = price.size();
        int pc[7];
        memset(pc,0,sizeof(pc));
        for(int i=0;i<N;i++) pc[i] = price[i];
        int nd[7];
        memset(nd,0,sizeof(nd));
        for(int i=0;i<N;i++) nd[i] = needs[i];
        
        for(int a=0; a<=nd[0]; a++){
            for(int b=0; b<=nd[1]; b++){
                for(int c=0; c<=nd[2]; c++){
                    for(int d=0; d<=nd[3]; d++){
                        for(int e=0; e<=nd[4]; e++){
                            for(int f=0; f<=nd[5]; f++){
                                dp[a][b][c][d][e][f] = a*pc[0]+b*pc[1]+c*pc[2]+d*pc[3]+e*pc[4]+f*pc[5];
                                for(int i=0;i<special.size();i++){
                                    int sp[7];
                                    memset(sp,0,sizeof(sp));
                                    for(int j=0;j<N;j++) sp[j] = special[i][j];
                                    int key = special[i][N];
                                    if(a>=sp[0]&&b>=sp[1]&&c>=sp[2]&&d>=sp[3]&&e>=sp[4]&&f>=sp[5]){
                                        dp[a][b][c][d][e][f] = min(dp[a][b][c][d][e][f],dp[a-sp[0]][b-sp[1]][c-sp[2]][d-sp[3]][e-sp[4]][f-sp[5]] + key);
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
        return dp[nd[0]][nd[1]][nd[2]][nd[3]][nd[4]][nd[5]];
    }
};