POJ1050 ToTheMax 【最大子矩阵和（无限制长宽）】

题目：

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.
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.
Input
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].
Output
Output the sum of the maximal sub-rectangle.

大致思路：

将整体问题化成每个子段的最大和，再将二维化成一维。进行DP处理

代码：

#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace  std;
int main()
{
    int n,a[110][110];
    int maxn=-10000;
    cin>>n;
    for(int i=1;i<=n;++i){
        int tp=0;
        for(int j=1;j<=n;++j){
            cin>>a[i][j];
            if(tp>0)//每行的最大子段和
                tp+=a[i][j];
            else
                tp=a[i][j];
            maxn=max(maxn,tp);
        }
    }
    for(int i=1;i<n;++i)
    for(int j=i+1;j<=n;++j){//枚举每一种压缩情况
        int tp=0;
        for(int k=1;k<=n;++k){
            a[i][k]+=a[j][k];//矩阵压缩处理
            if(tp>0)
                tp+=a[i][k];
            else
                tp=a[i][k];
            maxn=max(maxn,tp);
        }
    }
    cout<<maxn<<endl;
    return 0;
}