hdu 1712 ACboy needs your help 简单分组背包 每组至多选一个
2013-03-08 12:27
393 查看
hdu 1712
#include<stdio.h> #include<string.h> #define maxn 110 int dp[maxn][maxn],f[maxn][maxn],n,m;//n课程数 m天数 int end; int max(int a,int b) { return a>b?a:b; } int main() { int i,j,k; while(~scanf("%d %d",&n,&m)&&n+m!=0) { memset(dp,0,sizeof(dp)); memset(f,0,sizeof(f)); end=-1; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) scanf("%d",&f[i][j]); } for(i=1;i<=n;i++)//n门课 { for(j=1;j<=m;j++) //注意不要忘了当前不选最好的可能 dp[i][j]=dp[i-1][j]; for(j=m;j>=1;j--)//m天 计算总的dp[i][j] { for(k=1;k<=j;k++) //分组,与上一层比较,每个dp[i][j]都最多放一个i物品 { dp[i][j]=max(dp[i][j],dp[i-1][j-k]+f[i][k]); } end=max(dp[i][j],end); } } printf("%d\n",end); } return 0; }
相关文章推荐
- HDU 1712 ACboy needs your help (分组背包 每组至多选一个)
- HDU 1712 ACboy needs your help (简单分组背包)
- HDU ACboy needs your help 分组背包 每组至多放一个
- HDU_1712_ACboyNeedsYourHelp(分组背包)
- HDU 1712 ACboy needs your help(分组背包)
- [HDU 1712] ACboy needs your help 分组背包
- HDU 1712 ACboy needs your help 分组背包
- 动态规划:HDU1712-ACboy needs your help(分组背包问题)
- hdu 1712 ACboy needs your help(分组背包入门)
- HdU1712 ACboy needs your help 01分组背包
- ACboy needs your help (HDU_1712) 分组背包
- 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 1712 ACboy needs your help 【分组背包裸题】
- hdu 1712 ACboy needs your help(分组背包)
- hdu 1712 ACboy needs your help(分组背包)
- hdu 1712 ACboy needs your help 分组背包