hdu 1712 ACboy needs your help(分组背包)
来源:互联网 发布:大数据在线培训 编辑:程序博客网 时间:2024/05/16 14:28
简单分组背包入门,点击打开题目链接
#include<iostream>#include<cstdio>#include<cstring>#define Max(x,y) x>y?x:yint A[110][110];int f[110];int main(){ int n,m; while(scanf("%d%d",&n,&m) && (m+n)) { for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) scanf("%d",&A[i][j]); memset(f,0,sizeof(f)); for(int i=1;i<=n;i++) { for(int j=m;j>=0;j--) { for(int k=1;k<=m;k++) if(k<=j) f[j]=Max(f[j],f[j-k]+A[i][k]); } } printf("%d\n",f[m]); } return 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(DP 分组背包)
- 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(分组背包)
- 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(分组背包)
- 利用Google Chart服务生成二维码
- PS流包结构分析
- 工作邮件规范化建议--by ZoomQuiet
- [Python]yield用法入门
- redis 安装报错
- hdu 1712 ACboy needs your help(分组背包)
- 如何在外部获取当前A标签的ID值
- 如何高效的访问内存
- ES PES PS
- Hibernate4之JPA规范配置详解
- 贝叶斯法则的一个例题
- MeanShift算法及其应用
- 系统最小化安装没有wget解决方案
- C++实例 常用问题笔记