Ural 1146. Maximum Sum DP经典

1146. Maximum Sum

Time limit: 1.0 second
Memory limit: 64 MB

Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum. 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. A sub-rectangle is any contiguous sub-array of size 1 × 1 or greater located within the whole array.

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-hand corner and has the sum of 15.

Input

The input consists of an  N ×  N array of integers. The input begins with a single positive integer  Non a line by itself indicating the size of the square two dimensional array. This is followed by  N  2integers separated by white-space (newlines and spaces). These  N  2 integers make up the array in row-major order (i.e., all numbers on the first row, left-to-right, then all numbers on 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

The output is the sum of the maximal sub-rectangle.

Sample

input	output
4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2	15

输入部分第一行是一个正整数N,说明矩阵的大小。
下一行后面跟着 个整数。留意这些整数的输入格式可能比较混乱。
矩阵是以行优先存储的。N可能和100一样大，矩阵中每个数字的范围为 [-127, 127].

求最大子矩阵的和，先按列进行枚举起始列和结束列，用数据够快速求出每行起始列到结束列之间各数据的和，然后就可以降成一维的，问题就变成了求最大连续子序列了

#include<cstdio>
#include<string.h>
using namespace std;
const int M1 = 110;
const int INF = -100000000;

int N;
int table[M1][M1];
int row[M1][M1];

int main()
{
    scanf("%d",&N);
    memset(table,0,sizeof(table));
    memset(row,0,sizeof(row));
    for(int i=1; i<=N; ++i)
    {
        for(int j=1; j<=N; ++j)
        {
            scanf("%d",&table[i][j]);
            row[i][j] = row[i][j-1]+table[i][j];
        }
    }
    int ans=INF;
    for(int i=1; i<=N; ++i)
    {
        for(int j=i; j<=N; ++j) //枚举子矩阵的开始列好结束列
        {
            int mt=0,ms=INF;
            for(int k=1; k<=N; ++k) //求最大连续子序列和
            {
                if(mt>0)
                    mt += row[k][j]-row[k][i-1];
                else
                    mt = row[k][j]-row[k][i-1];
                if(mt>ms)
                    ms = mt;
            }
            if(ms>ans) ans = ms;
        }
    }
    printf("%d\n",ans);
    return 0;
}