HDOJ 题目2602 Bone Collector(动态规划,01背包)

本文介绍了一个经典的01背包问题——骨收集者问题。该问题是关于如何在有限的背包容量下,选择不同价值和体积的骨头以达到最大总价值。文章提供了完整的AC代码实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Bone Collector

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


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

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

Sample Output
  
14
 

Author
Teddy
 

Source
 思路:纯01背包,模板就够
ac代码
#include<stdio.h>
#include<string.h>
int maxx(int a,int b)
{
	if(a>b)
		return a;
	else
		return b;
}
int main()
{
	int v[100000],w[100000],i,j,n,m,t;
	int dp[2000];
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		memset(dp,0,sizeof(dp));
		for(i=0;i<n;i++)
			scanf("%d",&v[i]);
		for(i=0;i<n;i++)
			scanf("%d",&w[i]);
		for(i=0;i<n;i++)
			for(j=m;j>=w[i];j--)
			{
				dp[j]=maxx(dp[j],dp[j-w[i]]+v[i]);
			}
		printf("%d\n",dp[m]);
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值