hdoj2602

翻译 2012年03月28日 19:08:24

Bone Collector

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

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

1

5 10

1 2 3 4 5

5 4 3 2 1

Sample Output

14

/* 
 * File:   main.cpp
 * Author: LeeningLu
 *
 * Created on 2012年3月27日, 下午3:01
 */

#include<stdio.h>
#include<memory.h>
#define M 1010

int T;

int N;//骨头数量
int V;//背包容量

struct bone{
    int value;//骨头价值
    int volume;//骨头所占背包容量
}bone[M];

int bag[M];

int main(void)
{
    scanf("%d",&T);
    while(T--){
        scanf("%d%d",&N,&V);//读取骨头数量和背包容量
        for(int i=1;i<=N;i++)
            scanf("%d",&bone[i].value);//读取每个骨头的价值
        for(int i=1;i<=N;i++)
            scanf("%d",&bone[i].volume);//读取每个骨头所占背包容量
        memset(bag,0,sizeof(bag));//初始化数组
        for(int j=1;j<=N;j++){
            for(int i=V;i>=0;i--){//背包从大到小开始搜索是因为,如果从小到大开始搜索,有时会把一块骨头重复搜索两次
                if(i>=bone[j].volume&&bone[j].value+bag[i-bone[j].volume]>bag[i])
                    //状态转移方程max{bone[j].value+bag[i-bone[j].volume],bag[i]}
            }
        }
        printf("%d\n",bag[V]);
    }
    return 0;
}





相关文章推荐

HDOJ--2602--Bone Collector--dp--01背包

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDOJ 2602 Bone Collector 【0 1背包】

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others...

HDOJ 2602 Bone Collector

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

hdoj2602 Bone Collector【dp 01背包】

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others...

hdoj 2602 Bone Collector(模板)

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) T...

HDOJ2602--0-1背包Bone Collector

Problem Description Many years ago , in Teddy’s hometown there was a man who was called “Bone Col...
  • a305657
  • a305657
  • 2013年04月05日 02:02
  • 578

HDOJ 2602 Bone Collector(0-1背包)

原题链接题目描述题目大意给定一序列的骨头,每个骨头有它自己的体积(volume)和价值(value),现在给定一个容量为V的袋子,问此袋子能装下的骨头的最大价值是多少?题目分析这是一个基本的0-1背包...

hdoj 2602 0-1背包

Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

01背包——HDOJ2602拾骨者

问题陈述: Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This ma...

SSM2602.pdf

  • 2008年01月20日 13:35
  • 605KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj2602
举报原因:
原因补充:

(最多只允许输入30个字)