To the Max
Time Limit:1 Second Memory Limit: 32768 KB
Problem
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
Output the sum of the maximal sub-rectangle.
Example
Input
4
0 -2 -7 0 9 2 -6 2
-4 1 -4 1 -1
8 0 -2
Output
15
最多100行100列，对每个举行都要考虑到2500*2500，
当然计算每个矩形的元素和之前要预处理
，
令每行的[j，k}]素之和为a区域，s[i][j][k]表示从第一行到第i行的a区域之和，
所有对于行从[i,k],列从[p,q]的矩形，其元素和=s[k][p][q]-s[i-1][p][q];
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
后来发现，更好的办法是利用最大连续子序列，对第从第i行到第j行的矩形，其长度用最大连续子序列来求
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
