英语题目作业（23）

原题：

To The Max

 1000ms  32768K

描述：

Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 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.

输入：

The input consists of an N x 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 the sum of the maximal sub-rectangle.

样例输入：

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

样例输出：

15

（链接：To The Max | JXNUOJ）

翻译：

已知一个二维数组由正、负整数组成，一个子矩阵是整个数组任意大于或等于1*1的子数组。一个矩阵的和是该矩阵所有元素的和。在这个问题中子矩阵的最大和被称为最大矩阵。

例如，下面数组的最大子矩阵：
0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2

是左下角：

9 2
-4 1
-1 8

其和为15.

输入：

输入是一个N*N的整数矩阵。先在第一行输入一个正整数N,代表该方矩阵的大小。接下来是N2个整数，由空格分隔。这N2个整数为数组元素，按行顺序排列。即从第一行，从左到右，然后第二行，从左到右······N可能大到100，数组中数字范围[-127,127].

输出：

输出最大子矩阵的和。