HDU 1712 ACboy needs your help(分组背包经典题目)
来源:互联网 发布:电气cad软件哪个好 编辑:程序博客网 时间:2024/05/24 04:20
题目链接:http://http://acm.hdu.edu.cn/showproblem.php?pid=1712
题意:
有n门课程,m天时间
花费j天做第i门课,可以活的a[ i ][ j ] 的利益
求最大的利益
在01背吧的基础上增加了一个组
三重for循环就能搞定
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <string>using namespace std;int a[105][105];int dp[105];int main(){int n,m;while(~scanf("%d%d",&n,&m)){if(n==0 && m==0) break;memset(a,0,sizeof(a));memset(dp,0,sizeof(dp));for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){scanf("%d",&a[i][j]);}}for(int i=1;i<=n;i++){for(int j=m;j>=1;j--){for(int k=1;k<=m;k++){if(j>=k){dp[j] = max(dp[j],dp[j-k]+a[i][k]);}}}}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(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(分组背包)
- 版本控制入门
- 第三种是经典著作阅读法
- JDK版本不兼容问题之:一台机器安装多个版本的JDK
- 输入一个n,输出2到n的具体素数值
- 马的走法 SDUT
- HDU 1712 ACboy needs your help(分组背包经典题目)
- Equivalent Strings(二分+递归深搜)
- item控件抢占焦点的问题
- Spring事务配置
- vb查找注册表键值
- 负载均衡原理与实践学习笔记(二)
- Extjs方法的构造
- 【机房收费系统】机房收费系统之逻辑功能
- Linux下安装openvpn安装,配置