HDOJ 1712 ACboy needs your help(分组0/1背包)
2013-04-19 12:07
183 查看
把同一门考试当成一组,在一门考试里,花的天数和考的成绩分别是组内物品的代价和价值,这样就转化成一个分组的0/1背包的问题。
AC程序:
AC程序:
/*HDOJ1712 作者:陈佳润 2013-04-19 */ #include<iostream> using namespace std; #include<string.h> #define max(a,b) (a>b?a:b) int groud[105]; int dp[105]; int m; void ZeroOnePack(){ int k,i; for(i=m;i>0;i--){//对于每一个天数 for(k=1;k<=m;k++){//对于组内每一个物品 if(i>=k) dp[i]=max(dp[i],dp[i-k]+groud[k]); } } } int main(){ int n,i,j; //freopen("1.txt","r",stdin); while(cin>>n>>m&&(n!=0||m!=0)){ memset(dp,0,sizeof(dp)); for(i=1;i<=n;i++){//对于每一门考试 for(j=1;j<=m;j++){ cin>>groud[j]; } ZeroOnePack(); } cout<<dp[m]<<endl; } return 0; }
相关文章推荐
- HDOJ 1712 ACboy needs your help (分组背包)
- HDOJ 1712 ACboy needs your help (分组背包)
- HDOJ 1712 ACboy needs your help(分组背包)
- HDOJ 1712 ACboy needs your help(分组背包入门)
- HDU 1712 ACboy needs your help 分组背包
- hdu 1712 ACboy needs your help(分组背包模版)
- 分组背包基础--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(dp,分组背包)
- HdU1712 ACboy needs your help 01分组背包
- hdu 1712 ACboy needs your help (分组背包)
- ACboy needs your help(HDU 1712 分组背包入门)
- HDU 1712 ACboy needs your help(分组背包模板题)
- HDU-1712 ACboy needs your help (分组背包 入门题)
- hdu 1712 ACboy needs your help 分组背包
- hdu 1712 ACboy needs your help(分组背包)