HDU 1712 ACboy needs your help(二维DP）

#include <stdio.h>
#include <string.h>
int p[101][101],o[101][101];
int main()
{
int i,j,k,n,m,max;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(!n&&!m) break;
memset(p,0,sizeof(p));
memset(o,0,sizeof(o));
for(i = 1;i <= n;i ++)
{
for(j = 1;j <= m;j ++)
scanf("%d",&o[i][j]);
}
for(i = 1;i <= m;i ++)
{
p[1][i] = o[1][i];
}
for(i = 2;i <= n;i ++)
{
for(j = 0;j <= m;j ++)
{
max = 0;
for(k = 0;k <= j;k ++)
{
if(max < p[i-1][j-k] + o[i][k])
max = p[i-1][j-k] + o[i][k];
}
p[i][j] = max;
}
}
max = 0;
for(i = 1;i <= m;i ++)
{
if(max < p
[i])
max = p
[i];
}
printf("%d\n",max);
}
return 0;
}