转自http://blog.csdn.net/cnyali/article/details/48199251
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=110,maxm=110;
int a[maxn][maxn],f[maxm];
int main(){
int i,j,k,m,n;
while(1){
cin>>n>>m;
if(n+m==0)break;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
memset(f,0,sizeof(f));
for(i=1;i<=n;i++)
for(j=m;j>=0;j--)
for(k=1;k<=m;k++)
if(j>=k && f[j]<f[j-k]+a[i][k])
f[j]=f[j-k]+a[i][k];
cout<<f[m]<<endl;
}
return 0;
}