ZOJ 1074 To the Max

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=74

To the Max

---

Time Limit: 2 Seconds      Memory Limit: 65536 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 

题目大意：给你一个n*n的数字矩阵，叫你求一个子矩阵，这个子矩阵是所有子矩阵中和最大的。

思路：如果直接遍历，算法复杂度为o（n^4），必定超时，运用最大字段和算法可将为o(n^3)

这是二维的最大子段和，如何转化为1维的我们熟悉的情况？可以这样做，先枚举行列组合的所有情况，例如现在有n,行m列，我们可以把以每列为标准将所有行都缩成一个点，比如第1列，我们可以把第一列所有行累加起来，这样就完成了“缩点”.这样就转化为求m列的最大字段和了，就变成我们熟悉的一维的情况了。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<sstream>
#include<vector>
#include<map>
#include<stack>
#include<list>
#include<set>
#include<queue>
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1 | 1
using namespace std;
const int maxn=1005,maxe=100005,inf=1<<29;
int n,m;
int a[maxn][maxn],b[maxn];
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
            scanf("%d",&a[i][j]);
        int Max=-inf;
        for(int i=0;i<n;i++)
        {
            memset(b,0,sizeof(b));
            for(int j=i;j<n;j++)
            {
                int sum=0;
                for(int k=0;k<n;k++)
                {
                    b[k]+=a[j][k];
                    if(sum>0) sum+=b[k];
                    else sum=b[k];
                    if(Max<sum) Max=sum;
                }
            }
        }
        printf("%d\n",Max);
    }
    return 0;
}