非01背包有关问题

非01背包问题
题目：四种类型的物品，体积分别为2,3,5,6，价值分别为4,7,9,11.背包容量为8，每种物品的最大数量不限制


#include <iostream>
using namespace std;

#define MAXSIZE 8
#define NUM 4

int main(void)
{
    int size_value[NUM+1][2] = {{0,0},{2,4},{3,7},{5,9},{6,11}};
    int solution[NUM+1][MAXSIZE+1];
    int v[NUM+1];
    for(int p=0;p<=NUM;p++)
    {
        for (int q=0;q<=MAXSIZE;q++)
        {
            solution[p][q]=0;
        }
    }
   
    for(int i=0;i<=NUM;i++)
        v[i] = 0;
    
    for(int i=1;i<=NUM;i++)
    {      
        for(int j=1;j<=MAXSIZE;j++)
        {
            v[i] = 0;
            solution[i][j] = solution[i-1][j];
            for(v[i]=0;v[i]*size_value[i][0] <= j;v[i]++)
            {
                  if(solution[i][j] <= (solution[i-1][j-v[i]*size_value[i][0]] + v[i]*size_value[i][1])) //要注意的便是这个地方，01背包是solution[i-1][j]来比较，但是非01背包则需用solution[i][j]来比较，已记录得到最大值
                  {                   
                      solution[i][j] = solution[i-1][j-v[i]*size_value[i][0]] + v[i]*size_value[i][1];
                  }
            }                      
        }
              
    }
   
    for(int i=0;i<=NUM;i++)
    {    
        for(int j=0;j<=MAXSIZE;j++)
        {
            cout<<solution[i][j]<<" ";
        }
        cout<<"\n";
    }
   
    /*for(int i=0;i<=NUM;i++)
        cout<<v[i]<<" ";*/
   
    while(1)
       ;       
    return 0;
}