hdu 2602 Bone Collector 01背包

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 231).

Sample Input
1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output
14

题解：

裸的01背包，因为疏忽wrong answer两次。

代码：

#include <bits/stdc++.h>

using namespace std;
const int maxn =1000+10;
int v[maxn],w[maxn];
int f[maxn][maxn];
int main()
{
    int T;
    scanf("%d",&T);
    int N,V;
    while(T--)
    {
      memset(f,0,sizeof(f));
      cin>>N>>V;
      for(int i=1;i<=N;i++)
      {
         cin>>v[i];
      }
      for(int i=1;i<=N;i++)
      {
         cin>>w[i];
      }
      for(int i=1;i<=N;i++)
        for(int j=0;j<=V;j++)
      {
          f[i][j]=(i==1?0:f[i-1][j]);
          if(j>=w[i]) f[i][j]=max(f[i][j],f[i-1][j-w[i]]+v[i]);
      }
      cout<<f[N][V]<<endl;
    }
    return 0;
}