HDOJ 1712 ACboy needs your help (分组背包)
2012-10-01 18:40
344 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1712
题意:ACboy要在m天内学完n门课程,他花j天学第i门课程将获得A[i][j]的收益,求ACboy学完这n门课程可获得的最大收益。
思路:每一门课程有m种情况可选,但是学每门课只能选一种情况,所以可以把每一门课分别看成一个组,然后用分组背包求解。
题意:ACboy要在m天内学完n门课程,他花j天学第i门课程将获得A[i][j]的收益,求ACboy学完这n门课程可获得的最大收益。
思路:每一门课程有m种情况可选,但是学每门课只能选一种情况,所以可以把每一门课分别看成一个组,然后用分组背包求解。
#include<stdio.h> #include<string.h> int val[111][111]; int bag[111]; int main() { int n,m; while(scanf("%d%d",&n,&m)&&(n||m)) { int i,j,k; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { scanf("%d",&val[i][j]); } } memset(bag,0,sizeof(bag)); for(k=1;k<=n;k++) { for(j=m;j>0;j--)//每门课都必须要学,所以此处不可以等于0 { for(i=1;i<=j;i++)// { if(bag[j]<bag[j-i]+val[k][i]) bag[j]=bag[j-i]+val[k][i]; } } } printf("%d\n",bag[m]); } return 0; }
相关文章推荐
- HDOJ 1712 ACboy needs your help(分组背包)
- HDOJ 1712 ACboy needs your help(分组背包入门)
- HDOJ 1712 ACboy needs your help(分组0/1背包)
- HDOJ 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 分组背包
- hdu1712 ACboy needs your help 我的ACM我的梦,回顾篇 分组背包
- 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 (分组背包)