POJ1050--To the Max

Description

Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
As an example, the maximal sub-rectangle of the array:

0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2
is in the lower left corner:

9 2
-4 1
-1 8
and has a sum of 15.

Input

The input consists of an N * N array of integers. The input begins with a single positive integer N on a line by itself, indicating the size of the square two-dimensional array. This is followed by N^2 integers separated by whitespace (spaces and newlines). These are the N^2 integers of the array, presented in row-major order. That is, all numbers in the first row, left to right, then all numbers in the second row, left to right, etc. N may be as large as 100. The numbers in the array will be in the range [-127,127].

Output

Output the sum of the maximal sub-rectangle.

Sample Input

4
0 -2 -7 0 9 2 -6 2
-4 1 -4  1 -1

8  0 -2

Sample Output

15

/*
首先存前缀和
然后列数从1到N扫描，行数从第一行往下跑。为-的置0
*/
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 108
int sum[maxn][maxn];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n;j++)
			{
				int v;
				scanf("%d",&v);
				if(j == 1)	sum[i][j] = v;
				else sum[i][j] = sum[i][j-1] + v;
			}
		}
		int ans = 0;
		int nsum;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n-i;j++)
			{
				nsum = 0;
				for(int k=1;k<=n;k++)
				{
					nsum += sum[k][i+j-1] - sum[k][j-1];
					if(nsum > ans)	ans = nsum;
					if(nsum < 0) nsum = 0;
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}