英文题目翻译14

英文原题：题目来源：https://acs.jxnu.edu.cn/problem/HDU1081

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.

翻译：

最大子矩形

描述：

给定一个含正整数和负整数的二维数组，子矩形是位于整个数组中大小为1 x 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开始，表示正方形二维数组的大小。后跟由空格（空格和换行符）分隔的n^2个整数。这些是数组的n^2个整数，按行的主要顺序排列。也就是说，第一行的所有数字，从左到右，然后第二行的所有数字，从左到右，等等。N可能大到100。数组中的数字在[-127127]范围内。

输出：

输出最大子矩形的和。