HDU-Bone Collector(01背包问题)
来源:互联网 发布:手机藏文输入法软件 编辑:程序博客网 时间:2024/06/04 01:36
Bone Collector
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 49837 Accepted Submission(s): 20878
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 ?
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 231).
Sample Input
15 101 2 3 4 55 4 3 2 1
Sample Output
14
Author
Teddy
Source
HDU 1st “Vegetable-Birds Cup” Programming Open Contest
Recommend
lcy | We have carefully selected several similar problems for you: 1203 2159 2955 1171 2191
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<limits.h>#include<algorithm>using namespace std;int dp[1005][1005],a[1005],b[1005];int main(){int t,n,m,i,j;scanf("%d",&t);while(t--){memset(dp,0,sizeof(dp));scanf("%d%d",&n,&m);for(i=1;i<=n;i++)scanf("%d",&a[i]);for(i=1;i<=n;i++)scanf("%d",&b[i]);for(i=1;i<=n;i++) for(j=0;j<=m;j++) { if(b[i]<=j) dp[i][j]=max(dp[i-1][j],dp[i-1][j-b[i]]+a[i]); else dp[i][j]=dp[i-1][j]; }printf("%d\n",dp[n][m]);}}优化代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<limits.h>
#include<algorithm>
using namespace std;
int dp[1005],a[1005],b[1005];
int main()
{
int t,n,m,i,j;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof(dp));
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
scanf("%d",&b[i]);
for(i=1;i<=n;i++)
for(j=m;j>=b[i];j--)
dp[j]=max(dp[j-b[i]]+a[i],dp[j]);
printf("%d\n",dp[m]);
}
}
0 0
- HDU-Bone Collector(01背包问题)
- hdu 01背包问题 Bone Collector
- HDU 2602Bone Collector (01背包问题)
- hdu 2602 Bone Collector 01背包问题
- bone collector hdu 01背包问题
- hdu 2602 Bone Collector (01 背包问题)
- hdu 2602 Bone Collector(01背包问题)
- HDU 2602 Bone Collector(01背包问题)
- HDU 2602 Bone Collector(01背包问题)
- hdu 2602 Bone Collector (01背包)
- hdu 2602 Bone Collector(01背包)
- HDU 2602 Bone Collector( 01背包 )
- HDU 2602 Bone Collector(01背包)
- HDU 2602 Bone Collector(01背包)
- HDU 2602 Bone Collector (01背包)
- HDU 2602 Bone Collector(01背包)
- HDU 2602 Bone Collector(01背包)
- hdu 2602 Bone Collector (01背包)
- 求解质因数
- 限制排列与棋盘多项式
- Java传值问题
- 357. Count Numbers with Unique Digits统计各位不同的数字个数
- QT学习之路————QT程序在开发板上显示 中文字体
- HDU-Bone Collector(01背包问题)
- Maven之——插件目标及绑定
- 使用 Collectd + InfluxDB + Grafana 监控主机
- 例题3-3 回文词 UVa401
- HDU-1079 Calendar Game(博弈论)
- Qt+opencv开发笔记(1)
- 整数对查找
- 决策树算法(五)——处理一些特殊的分类
- CubieTruck安装Redis