POJ1050二维数组的最大子数组和

#include <stdio.h>
#include <memory.h>
int data[101][101];
int DP[101];
int main()
{
int N;
scanf("%d",&N);
for (int i = 0;i<N;++i)
for (int j = 0;j<N;++j)
scanf("%d",&data[i][j]);
int max = 0;
for (int k=0;k<N;++k)
{
memset(DP,0,sizeof(DP));
for(int i =k;i<N;++i)
{
int b =0;
for(int j = 0;j<N;++j)
{
DP[j] +=data[i][j];
if(b>=0)b+=DP[j];
else b = DP[j];
if(b>max)max =b;
}
}
}
printf("%d/n",max);
return 0;
}