POJ 1050 To the Max(dp 最大子矩阵和/最大子段和问题)

题目地址：点击打开链接

题意：求最大子矩阵和。

思路：

我们知道最大子段和可以用DP O（n）时间复杂度解决，现在是求最大子矩阵和，那么我们可以通过枚举行区间，然后

把这个行区间的每列的和做成一个数组，求这个数组的最大子段和。

就是求出这个行区间中的最大子矩阵（矩阵高为行间距的子矩阵），所以枚举行区间，每次把这个行区间变成最大子段

和问题，就可以得到答案。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 105;
int pic[maxn][maxn], sum[maxn][maxn], tmp[maxn], n, ans;

void solve(int l, int r)
{
    for(int i = 1; i <= n; i++)
        tmp[i] = sum[r][i]-sum[l-1][i]; //把这个行区间的每列列和做成一个数组
    int tsum = 0;
    for(int i = 1; i <= n; i++)
    {
        tsum += tmp[i];
        if(tsum < 0) tsum = 0;
        else ans = max(ans, tsum);
    }
}

int main(void)
{
    while(cin >> n)
    {
        ans = -0x3f3f3f3f;
        memset(sum, 0, sizeof(sum));
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d", &pic[i][j]), sum[i][j] = sum[i-1][j]+pic[i][j]; //第j列的前i行的前缀和
        for(int i = 1; i <= n; i++)
            for(int j = i; j <= n; j++)
                solve(i, j);
        printf("%d\n", ans);
    }
    return 0;
}

To the Max

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 48195		Accepted: 25513

Description

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.

Sample Input

4
0 -2 -7 0 9 2 -6 2
-4 1 -4  1 -1

8  0 -2

Sample Output

15