[2602]Bone Collector (HDU)
来源:互联网 发布:淘宝买岛国片搜什么 编辑:程序博客网 时间:2024/06/04 01:21
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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
15 101 2 3 4 55 4 3 2 1
Sample Output
14
01背包
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
int w[1100],v[1100],bg[1100];
int main()
{
int z,n,m,i,j;
scanf("%d",&z);
while(z--)
{
memset(bg,0,sizeof(bg));
scanf("%d %d",&n,&m);
getchar();
for(i=0;i<n;i++)
scanf("%d",&w[i]);
for(i=0;i<n;i++)
scanf("%d",&v[i]);
for(i=0;i<n;i++)
{
for(j=m;j>=v[i];j--)//从后向前
{
if(bg[j]<bg[j-v[i]]+w[i])
bg[j]=bg[j-v[i]]+w[i];
}
}
printf("%d\n",bg[m]);
}
return 0;
}
#include <stdio.h>
#include <stdlib.h>
int w[1100],v[1100],bg[1100];
int main()
{
int z,n,m,i,j;
scanf("%d",&z);
while(z--)
{
memset(bg,0,sizeof(bg));
scanf("%d %d",&n,&m);
getchar();
for(i=0;i<n;i++)
scanf("%d",&w[i]);
for(i=0;i<n;i++)
scanf("%d",&v[i]);
for(i=0;i<n;i++)
{
for(j=m;j>=v[i];j--)//从后向前
{
if(bg[j]<bg[j-v[i]]+w[i])
bg[j]=bg[j-v[i]]+w[i];
}
}
printf("%d\n",bg[m]);
}
return 0;
}
0 0
- HDU 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- HDU 2602 - Bone Collector
- HDU 2602 Bone Collector
- hdu 2602 Bone Collector
- HDU 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- Hdu 2602 - Bone Collector
- hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- Hdu 2602 Bone Collector
- Hdu 2602 Bone Collector
- hdu 2602 Bone Collector
- hdu - 2602 - Bone Collector
- hdu 2602 Bone Collector
- Android动画之translate(位移动画)
- poj2531~剪枝dfs枚举题
- JICE
- RS232 RS422 RS485的区别
- 第一个C++类实例
- [2602]Bone Collector (HDU)
- iOS 中GET请求
- nethogs
- 使用AMOS图形建立和检测模型(3)
- 搞不懂啊,为什么会这样,连结果都输不出来,怎么就AC了呢?
- html dojo1.9
- 算法笔记--图的基本遍历
- iOS的三维透视投影
- 机房收费系统之上下机