动态规划 -- 背包问题

//动态规划 -- 背包问题
//dp[i][j] = max{dp[i-1][j], dp[i-1][j-w[j]] + val[i]}
#include<iostream>
# include<cstring>
# define max(a,b) a>b?a:b
using namespace std;

int main()
{

    int dp[101][1001],m,W,w[101],val[101],i,j;
    cout<<"input the total weight"<<endl;
    cin>>W;
    cout<<"input the total number of staffs"<<endl;
    cin>>m;
    for(i=0;i<m;i++)
        cin>>w[i]>>val[i];
    memset(dp,0,sizeof(dp));
    for(i=0;i<m;i++)
     for(j=0;j<=W;j++)//j.......V-c[i]
     {
        if(j>=w[i])
        {
             dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+val[i]);//........
             cout<<"dp["<<i<<"]["<<j<<"]="<<dp[i][j]<<endl;
        }
        else
        {
             dp[i][j]=dp[i-1][j];
              cout<<"dp["<<i<<"]["<<j<<"]="<<dp[i][j]<<endl;
        }
     }
     cout<<dp[m-1][W]<<endl;
     return 0;
}