51nod-最大子矩阵和

<span style="font-size:18px;">#include<cstdio>#define inf 0x3f3f3f3fint c[600]; int map[600][600];int main(){int m,n;scanf("%d%d",&m,&n);//n行，m列int i,j;for(i=1;i<=n;++i)for(j=1;j<=m;++j)scanf("%d",&map[i][j]);int sum,max=-inf;for(i=1;i<=n;++i){for(j=i;j<=n;++j){sum=0;for(int k=1;k<=m;++k){if(i==j)c[k]=map[j][k];elsec[k]=c[k]+map[j][k];sum+=c[k];if(sum>max)max=sum;if(sum<0)sum=0;}}}printf("%d\n",max);return 0;}</span>