hdu 1712 ACboy needs your help(分组背包)
2013-04-02 16:19
351 查看
简单分组背包入门,点击打开题目链接
#include<iostream>
#include<cstdio>
#include<cstring>
#define Max(x,y) x>y?x:y
int 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;
}
#include<iostream>
#include<cstdio>
#include<cstring>
#define Max(x,y) x>y?x:y
int 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-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 (分组背包)
- 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 分组背包
- hdu 1712 ACboy needs your help 简单分组背包 每组至多选一个
- 动态规划:HDU1712-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(分组背包经典题目)