Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 45584 Accepted Submission(s): 18958
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
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[1005],b[1005];
int c[1005][1005];
int main()
{
int t,n,v;
cin>>t;
while(t--)
{
int i,j;
cin>>n>>v;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
cin>>b[i];
for(i=1;i<=n;i++)
{
for(j=0;j<=v;j++)//所剩空间
{
if(j>=b[i])
c[i][j]=c[i-1][j]>(c[i-1][j-b[i]]+a[i])?c[i-1][j]:(c[i-1][j-b[i]]+a[i]);
else
c[i][j]=c[i-1][j];
}
}
cout << c[n][v]<<endl;
}
return 0;
}
滚动数组:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1005;
int dp[N],va[N],vo[N];
int main()
{
int t,n,v;
cin >> t;
while(t--)
{
scanf("%d%d",&n,&v);
for(int i = 1;i <= n;i++)
scanf("%d",&va[i]);
for(int i = 1;i <= n;i++)
scanf("%d",&vo[i]);
memset(dp,0,sizeof(dp));
for(int i = 1;i <= n;i++)
{
for(int j = v;j >= vo[i];j--)
{
dp[j] = max(dp[j],dp[j-vo[i]] + va[i]);
}
}
printf("%d\n",dp[v]);
}
}