Bone Collector

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 65 Accepted Submission(s) : 23

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

Sample Input

Sample Output

解题思路：

核心代码：

dp[j]=max(dp[j],dp[j-w[i]]+v[i]);

ac代码：

#include <iostream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstring>
#define ll long long int
#define maxn 1005
using namespace std;
int v[maxn],w[maxn],dp[maxn];
int main()
{int t,n,V,i,j,ans;scanf("%d",&t);while(t--){memset(dp,0,sizeof(dp));scanf("%d %d",&n,&V);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=V;j>=w[i];j--)dp[j]=max(dp[j],dp[j-w[i]]+v[i]);printf("%d\n",dp[V]);}return 0;}

hdoj2602:Bone Collector（01背包问题-dp-模版题）相关推荐

HDU Bone Collector (01背包问题)
之前背包问题学了忘学了忘= =是太笨了. 题目许多年前,在泰迪的家乡,有一个人被称为"骨收集者".这个人喜欢收集各种骨头,例如狗,牛的骨头,他也去了坟墓-- 骨头收集者有一个大袋 ...
hdu 2602 Bone Collector 01背包
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T ...
HDU 2639 Bone Collector II （dp）
题目链接 Problem Description The title of this problem is familiar,isn't it?yeah,if you had took part in ...
01背包问题dp优化
背包容量m给定,选择n件物品,求放入背包的最大价值. 其中,物品只能选择一次,要么放,要么不放. 朴素解法经典的DP问题状态:f[i][j]f[i][j]f[i][j]表示选择前iii个物品,背包 ...
动态规划---01背包问题--Dp（详解附代码）
一.动态规划代表一类问题(最优子结构或子问题最优性)的一般解法,是设计方法或者策略,不是具体算法本质:递推,核心是找到状态转移的方式,写出dp方程. 解决问题:交叉,重叠子问题(最优子问题) 形式 ...
0-1背包问题（DP）-超有趣版
0-1背包问题(DP)-超有趣版文章目录 0-1背包问题(DP)-超有趣版一. 0-1背包问题二. 0-1背包问题分析三.0-1背包问题--DP算法求解四.0-1背包问题--DP算法深入分析 ...
Bone Collector（01背包问题-两种写法）
Many years ago , in Teddy's hometown there was a man who was called "Bone Collector". This ...
HDU 2602 Bone Collector DP(01背包)
Bone Collector Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Desc ...
Bone Collector（骨头收集者）c++(01背包问题)
题目来源:杭州电子科技大学 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total ...
hdu 2602 Bone Collector（01背包）模板
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602 Bone Collector Time Limit: 2000/1000 MS (Java/Ot ...

hdoj2602:Bone Collector（01背包问题-dp-模版题）

Bone Collector

解题思路：

ac代码：

hdoj2602:Bone Collector（01背包问题-dp-模版题）相关推荐

最新文章

热门文章