题目:
https://vjudge.net/problem/HDU-1712
题解:
分组背包问题;
代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=100,M=100;
int n,m,grp[N][M],dp[M];
int main(){
while(scanf("%d%d",&n,&m)!=EOF){
if(n==0&&m==0) return 0;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
scanf("%d",&grp[i][j]);
}
}
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++){
for(int j=m;j>=0;j--){
for(int k=1;k<=j;k++){
dp[j]=max(dp[j],dp[j-k]+grp[i][k]);
}
}
}
printf("%d\n",dp[m]);
}
return 0;
}