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:
给你一个二维数组,都是整数,这个矩形的总和就是所有元素的总和,子区域就是大小最少为1*1的子数组,子数组在这个问题里,值的总和为最大的子区域作为最大的子区域。
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.
此区域最大的数值最大的子区域就是左下角的区域,总和为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].
输入N*N的数组,第一行输入N,表示二维数组的规模大小。接下来的行数不定,N个数字,以一个空格间隔。这个数组有N*N个数字,所有数字都是从左到右输入,N最大值为100,数组内的数字的范围为-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