HDU 2602 Bone Collector （0-1背包）

最新推荐文章于 2022-07-30 10:01:05 发布

TooSIMple_

最新推荐文章于 2022-07-30 10:01:05 发布

阅读量177

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/i1020/article/details/54633694

版权

ACM 专栏收录该内容

261 篇文章 3 订阅

订阅专栏

Bone Collector

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

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

Sample Output

Author

Teddy

Source

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

0-1背包的模板题状态转移方程: f[v] = max(f[v],f[v - cost] + weight);

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int n,v,f[1005];

void ZeroOnePack(int value, int area){
	for(int i = v; i >= area; i --)
		f[i] = max(f[i],f[i - area] + value);
}

int main(){
	int T;
	int a[1005],b[1005];
	scanf("%d",&T);
	
	while(T --){
		
		memset(f,0,sizeof(f));
		
		scanf("%d%d",&n,&v);
		for(int i = 0; i < n; i ++)
			scanf("%d",&a[i]);
		for(int i = 0; i < n; i ++)
			scanf("%d",&b[i]);

		for(int i = 0; i < n; i ++)
			ZeroOnePack(a[i],b[i]);
	
		printf("%d\n",f[v]);
	}
	
	return 0;
}