pku 1050 To the Max

2009-10-07 

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

代码：

 

#include<stdio.h>
#include<string.h>
#define N 101
int a[N][N],b[N];
int maxsum(int b[101],int n)//求取一维的连续数字和
{
 int max,sum,i; 
 max=0;//将最大值保存在max中
 sum=0;//保存连续的数字和
 for(i=0;i<n;i++)
 {
  if(sum<0) sum = b[i];//小于0 则可以舍掉
  else sum += b[i];
  if(sum>max)max=sum;
 }
 return max;
}

int main()
{
 int n,i,j,k,max,temp;
 scanf("%d",&n); 
 for(i=0;i<n;i++)
  for(j=0;j<n;j++)
   scanf("%d",&a[i][j]);
  max=a[0][0]; //保存整个二维矩阵中间的最大的子矩阵的和
  for(i=0;i<n;i++)
  {
   memset(b,0,sizeof(b)); //将连续的数行数字对应相加，保存在b[]中间
   for(k=i;k<n;k++) //求取连续的数行数字相加的和，依次叠加
   {
    for(j=0;j<n;j++)
    {     
     b[j]+=a[k][j];   
     
    }
    temp=maxsum(b,n); //求取连续k行相加后的最大子矩阵和
    if(temp>max)max=temp; 
   }     
  }
  printf("%d/n",max);
  return 0;
  
}

例如：

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

我们可以把求矩阵的最大子矩阵和化成求一维的数组的，连续数字和最大，只是将连续的矩阵行进行了叠加。

先连续相加1-1  求出最大连续和；然后加上第二行的变成求 1-2 的对应列的和，求最大的连续和；再在原来的基础上加上第三行的数字变

成求1-3的最大连续和； 后面一次类推……

如题中结果是2-4行所得的b[]中1-2列的和最大，即为 

 9 2 
-4 1 
-1 8