HDU 2602 Bone Collector

Bone Collector

题目：http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1005&ojid=0&cid=13029&hide=0

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[sup]31[/sup]).

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

题意：有很多骨头，不同的重量，不同的价值，要求一定的背包容量所装的骨头价值最大
思路：典型的01背包
代码：

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cstring>
using namespace std;

int f[1020];
int v,n,t;
int c[1010],w[1010];
void OneZeroPack(int cost,int value)//01背包模板
{
    for(int j=v; j>=cost; j--)
    {
        f[j]=max(f[j],f[j-cost]+value);//放与不放取较大值
    }
}
int main()
{
    cin >> t;
    while(t--)
    {
        memset(f,0,sizeof(f));///因为是多组数据，每次都要归零的。
        cin >> n >> v;
        for(int i=0; i<n; i++)
            cin >> w[i];
        for(int i=0; i<n; i++)
            cin >> c[i];
        for(int i=0; i<n; i++)
            OneZeroPack(c[i],w[i]);
        cout << f[v] << endl;
    }
    return 0;
}

来源：https://i.csdn.net/