ACM: poj 1050

                                                                                                                                              To the Max
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

题意: 在给出的矩阵中, 找出子矩阵中和最大. 子矩阵的和是每个元素的和.

解题思路:

               1. 类比与一维的最大和, 二维的情况就是再一维的情况下再枚举出出来i,j行列.

代码:

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
#define MAX 105

int n;
int g[MAX][MAX], temp[MAX];

int main()
{
//    freopen("input.txt","r",stdin);
    while(scanf("%d",&n) != EOF)
    {
        for(int i = 0; i < n; ++i)
        {
            for(int j = 0; j < n; ++j)
                scanf("%d",&g[i][j]);
        }
       
        int result = -(1<<20);
        for(int i = 0; i < n; ++i)
        {
            memset(temp,0,sizeof(temp));
            for(int j = i; j < n; ++j)
            {
                for(int k = 0; k < n; ++k)
                    temp[k] += g[j][k];
                int q = 0;
                for(int p = 0; p < n; ++p)
                {
                    if(q > 0) q += temp[p];
                    else q = temp[p];
                    if(result < q) result = q;
                }
            }
        }
        printf("%d\n",result);
    }
    return 0;
}