hdu 1712 ACboy needs your help dp

分组背包，学习了！

#include <stdio.h>
#include <string.h>

int dp[105];

int max(int a,int b)
{
    return a>b?a:b;
}

int main()
{
    int n,m,i,j,k,ar[105][105];
    while (scanf("%d%d",&n,&m)!=EOF&&n&&m)
    {
        for (i=1;i<=n;i++)
        {
            for (j=1;j<=m;j++)
            {
                scanf("%d",&ar[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));
        for (k=1;k<=n;k++)
        {
            for (i=m;i>0;i--)
            {
                for (j=1;j<=m;j++)
                {
                    if(i>=j)dp[i]=max(dp[i],dp[i-j]+ar[k][j]);
                }
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}