HDU2602（简单背包问题）

Bone Collector

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 42688 Accepted Submission(s): 17774

Problem Description

Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

Input

The first line contain a integer T , the number of cases.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.

Output

One integer per line representing the maximum of the total value (this number will be less than 2 ³¹).

Sample Input

  
  

   
   1
5 10
1 2 3 4 5
5 4 3 2 1
  
  

Sample Output

  
  

   
   14
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   
#include<stdio.h>
#include<string.h>

int main()
{
  int v[1010],w[1010];
  int dp[1010];
  int n,i,j,T,max;
  scanf("%d",&T);
  while(T--)
  {
      scanf("%d%d",&n,&max);
      for(i=0;i<n;i++)
      scanf("%d",&v[i]);
      for(i=0;i<n;i++)
      scanf("%d",&w[i]);

      memset(dp,0,sizeof(dp));//不要忘记每次要清空dp数组

      for(i=0;i<n;i++)//从第一个物品开始
          for(j=max;j>=w[i];j--)//在装满的情况下，可以到第i个物品时；
          {
              if(dp[j]<dp[j-w[i]]+v[i])//设置当前容量的最大价值，如果最大价值要小于第i个物品装进来
                  dp[j]=dp[j-w[i]]+v[i];//更改最大价值
          }
          printf("%d\n",dp[max]);

  }
  return 0;

}