{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 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. \n \u003cbr\u003eAs an example, the maximal sub-rectangle of the array: \n \u003cbr\u003e \n \u003cbr\u003e 0 -2 -7 0 \n \u003cbr\u003e 9 2 -6 2 \n \u003cbr\u003e-4 1 -4 1 \n \u003cbr\u003e-1 8 0 -2 \n \u003cbr\u003eis in the lower left corner: \n \u003cbr\u003e \n \u003cbr\u003e 9 2 \n \u003cbr\u003e-4 1 \n \u003cbr\u003e-1 8 \n \u003cbr\u003eand has a sum of 15. \n \u003cbr\u003e\n \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 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].\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n Output the sum of the maximal sub-rectangle.\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e\n4\n0 -2 -7 0 \n9 2 -6 2 \n-4 1 -4 1 \n-1 8 0 -2 \n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e15\u003c/pre\u003e"}}]}