#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
using namespace std;
const int INF = 0x3f3f3f3f;
int a[105][105];
int vs_main()
{
int n, i, j, k;
int temp;
while (scanf("%d", &n) != -1)
{
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
scanf("%d", &temp);
a[i][j] = a[i][j - 1] + temp;
}
}
int Max = -INF;
for (i = 0; i <= n; i++)
{
for (j = i+1; j <= n; j++)
{
int sum = 0;
for (k = 1; k <= n; k++)
{
sum += a[k][j] - a[k][i];
Max = max(Max, sum);
if (sum < 0)
sum = 0;
}
}
}
printf("%d\n", Max);
}
return 0;
}
HDU 1081(组大矩阵)
最新推荐文章于 2023-09-14 16:49:12 发布