hdu2602 Bone Collector 01背包教学题

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 52285    Accepted Submission(s): 22035

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
  
  

 

Author

Teddy

 

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

01背包的教学题。。转移方程很好理解，只有取和不取两种选择，zhangjiatao1已经讲得很清楚了。。。一直没有把这题放到blog上因为找不到之前a的代码。。。今天重新打了一遍居然蜜汁WA了三回。。。。

奶奶的。。。

WA的点是，在第二层循环中的j必须从0开始。。为啥呢。。。

想过去就算从1开始也不会错啊，当背包大小为空的时候必然是无法装下骨头的。。。

难道测试数据中有体积为0的神之骨头？？？

下面代码：

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
using namespace std;
const int maxn = 1005;
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int  bag,n,w[maxn],v[maxn],f[maxn][maxn],i,j;
        memset(f, 0, sizeof(f));
        scanf("%d%d",&n,&bag);
        for(i=1;i<=n;i++){
            scanf("%d",&w[i]);
        }
        for(i=1;i<=n;i++){
            scanf("%d",&v[i]);
        }
        for(i=1;i<=n;i++){
            for(j=0;j<=bag;j++){
                if(j>=v[i]){
                    f[i][j]=max(f[i-1][j-v[i]]+w[i],f[i-1][j]);
                }else{
                    f[i][j]=f[i-1][j];
                }
            }
        }
        printf("%d\n",f[n][bag]);
    }
    return 0;
}