hdu2602——Bone Collector

01背包问题！

1.现在的f[v-c[i]]就相当于原来的f[i-1][v-c[i]];

2. f[i][v]表示前i件物品恰放入一个容量为v的背包可以获得的最大价值.

#include<stdio.h> #include<string.h> int a[1005],b[1005]; int f[1005]; int main() { int t,i,j,n,v; scanf("%d",&t); while(t--) { memset(f,0,sizeof(f)); scanf("%d%d",&n,&v); 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=v;j>=0;j--) { if(j-b[i]>=0) { f[j]=f[j-b[i]]+a[i]>f[j]?f[j-b[i]]+a[i]:f[j]; } else f[j]=f[j]; } printf("%d/n",f[v]); } }

hdu2602——Bone Collector相关推荐

HDU2602 Bone Collector【0/1背包+DP】
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T ...
Bone Collector（HDU-2602）
Problem Description Many years ago , in Teddy's hometown there was a man who was called "Bone C ...
HDU 2602 Bone Collector DP(01背包)
Bone Collector Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Desc ...
hdu 2602 Bone Collector 01背包
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T ...
HDU Problem 2062 Bone Collector【01背包】
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T ...
Bone Collector
Many years ago , in Teddy's hometown there was a man who was called "Bone Collector". This ...
HD 2602 Bone Collector （0-1背包）
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602 Problem Description Many years ago , in Teddy's ...
hdu 2602 Bone Collector（01背包）模板
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2602 Bone Collector Time Limit: 2000/1000 MS (Java/Ot ...
hdu2602 Bone Collector-01背包问题
Problem Description Many years ago , in Teddy's hometown there was a man who was called "Bone C ...

hdu2602——Bone Collector

hdu2602——Bone Collector相关推荐

最新文章

热门文章