hdu 1712 ACboy needs your help(分组背包模版)
来源:互联网 发布:淘宝网牛仔女裤 编辑:程序博客网 时间:2024/05/22 13:38
原题: http://acm.hdu.edu.cn/showproblem.php?pid=1712
//分组背包//dp[k][v]表示前k组物品花费费用v能取得的最大权值 //dp[k][v] = max(dp[k-1][v],dp[k-1][v-Ci]+Wi)| i= 1..group[k]); #include<stdio.h>int max(int a,int b){if(a>=b)return a;return b;}int main(){while(true){int n,m;scanf("%d %d",&n,&m);if(n==0 && m==0){break;}int dp[100+10]={0}; for(int i=1;i<=n;i++)//第i种课 {int value[100+10]; for(int j=1;j<=m;j++)//花j天 {scanf("%d",&value[j]);//可以获得value[j]收益 }for(int j=m;j>=0;j--)//dp ,这里顺序注意 ! 必须保证每组最多只取一个 {for(int k=1;k<=m;k++)//遍历这组的第k个商品 {if(j>=k){dp[j]=max(dp[j],dp[j-k]+value[k]);}else{break;}}} }printf("%d\n",dp[m]);}return 0;}
阅读全文
0 0
- hdu 1712 ACboy needs your help(分组背包模版)
- hdu 1712 ACboy needs your help 分组背包
- hdu 1712 ACboy needs your help(分组背包入门题)
- HDU 1712 ACboy needs your help(分组背包)
- 【hdu 1712】ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- HDU 1712 ACboy needs your help ----分组背包
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- HDU 1712 ACboy needs your help(DP 分组背包)
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- hdu 1712ACboy needs your help 01背包(分组)
- HDU 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help (分组背包)
- hdu 1712 ACboy needs your help (分组背包)
- 洛谷P2392 kkksc03考前临时抱佛脚
- java入门篇
- 机器学习入门学习笔记:(3.2)ID3决策树程序实现
- 混淆模板
- 曾经它认识我,我不认识他的Linux系统
- hdu 1712 ACboy needs your help(分组背包模版)
- MVP_P层
- 2017年11月第2周学习总结
- 文章标题
- spark2.2.0搭建standalone集群环境
- zabbix入门简介
- LeetCode——Subtree of Another
- ssm基本配置
- QA测试