ZOJ1074

Description

Problem

 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 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.

Example

Input

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

Output

15 

思路

题意就是求最大子阵和

代码

#include<stdio.h>
#include<string.h>
#define MAX 105
#define INF 10000
int maxsub(int arr[],int n)
{
    int i,maxsum=-INF,sum=0;
    for(i=1;i<=n;i++)
    {
        sum+=arr[i];
        if(sum>maxsum)
            maxsum=sum;
        if(sum<0)
            sum=0;
    }
    return maxsum;
}
int main()
{
    int n,i,j,k,dp[MAX][MAX],arr[MAX];
    int maxsubrec,maxsubarr;
    while(~scanf("%d",&n))
    {
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                scanf("%d",&dp[i][j]);
            }
        }
        maxsubrec=-INF;
        for(i=1;i<=n;i++)
        {
            memset(arr,0,sizeof(arr));
            for(j=i;j<=n;j++)
            {
                for(k=1;k<=n;k++)
                {
                    arr[k]+=dp[j][k];
                }
                maxsubarr=maxsub(arr,n);
                if(maxsubarr>maxsubrec)
                    maxsubrec=maxsubarr;
            }
        }
        printf("%d\n",maxsubrec);
    }
    return 0;
}