#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
#define MAXN 1111
int mar[MAXN][MAXN];
int main()
{
int n, val;
while(scanf("%d", &n) != EOF && n)
{
memset(mar, 0, sizeof(mar));
for( int i = 1; i <= n; i++)
{
for( int j = 1; j <= n; j++)
{
scanf("%d",&mar[i][j]);
mar[i][j] += mar[i][j-1];
}
}
int maxn = -0x1f1f1f;
for( int i = 1; i <= n; i++)
{
for( int j = i + 1; j <= n; j++)
{
int res = 0;
for( int k = 1; k <= n; k++)
{
res += (mar[k][j] - mar[k][i-1]);
if(res > maxn)
maxn = res;
if(res < 0)
res = 0;
}
}
}
printf("%d\n",maxn);
}
}
UVA 108
最新推荐文章于 2020-09-01 22:53:05 发布