To The Max

To The Max

时间限制(普通/Java):3000MS/10000MS          运行内存限制:65536KByte
总提交:11            测试通过:8

描述

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² integers separated by whitespace (spaces and newlines). These are the N² 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 the sum of the maximal sub-rectangle.

样例输入

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

8 0 -2

样例输出

15

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[110][110];
int b[10000];
int main()
{
    int n,m,i,j,k;
    while(scanf("%d",&n)!=EOF)
    {
        int max=-100;
        for(i=0; i<n; i++)
        {
            for(j=0; j<n; j++)
            {
                scanf("%d",&a[i][j]);
            }
        }
        for(i=0; i<n; i++)
        {

            memset(b,0,sizeof(b));
            for(j=i; j<n; j++)
            {
                int t=0;
                for(k=0; k<n; k++)
                {
                    b[k]+=a[j][k];
                    //printf("%d ",b[k]);
                    if(t<=0)
                    {
                        t=b[k];
                    }
                    else
                        t+=b[k];
                    if(t>max)
                        max=t;
                }
            }
        }
        printf("%d\n",max);
    }
    return 0;
}