Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8664 Accepted Submission(s): 3307
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 ?
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.
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
31).
Sample Input
1 5 10 1 2 3 4 5 5 4 3 2 1
Sample Output
14
Author
Teddy
Source
#include<iostream>
#include<stdio.h>
using namespace std;
long long value[1001];
long long volume[1001];
long long f[1001];
int N,V;
void zeroonepack(int cost ,int weight)
{
for(int i=V;i>=cost;i--)
{
f[i]=max(f[i],f[i-cost]+weight);
}
}
int main()
{
freopen("in.txt","r",stdin);
int t;
cin>>t;
while(t>0)
{
t--;
cin>>N>>V;
for(int i=1;i<=N;i++)
{
cin>>value[i];
}
for(int i=1;i<=N;i++)
{
cin>>volume[i];
}
for(int i=0;i<=V;i++)
{
f[i]=0;
}
for(int i=1;i<=N;i++)
{
zeroonepack(volume[i],value[i]);
}
cout<<f[V]<<endl;
}
return 0;
}
#include<stdio.h>
using namespace std;
long long value[1001];
long long volume[1001];
long long f[1001];
int N,V;
void zeroonepack(int cost ,int weight)
{
for(int i=V;i>=cost;i--)
{
f[i]=max(f[i],f[i-cost]+weight);
}
}
int main()
{
freopen("in.txt","r",stdin);
int t;
cin>>t;
while(t>0)
{
t--;
cin>>N>>V;
for(int i=1;i<=N;i++)
{
cin>>value[i];
}
for(int i=1;i<=N;i++)
{
cin>>volume[i];
}
for(int i=0;i<=V;i++)
{
f[i]=0;
}
for(int i=1;i<=N;i++)
{
zeroonepack(volume[i],value[i]);
}
cout<<f[V]<<endl;
}
return 0;
}
这是一个0-1背包问题,比较典型也比较简单不说了、。。。