北大ACM poj1050 To the Max（C++）

最新推荐文章于 2019-10-20 18:18:33 发布

gubojun

最新推荐文章于 2019-10-20 18:18:33 发布

阅读量1.4k

点赞数

文章标签： c++ numbers whitespace input integer ini

本文链接：https://blog.csdn.net/gubojun123/article/details/7797329

版权

To the Max

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 32446		Accepted: 16930

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

#include<stdio.h>
int s[100],n;
int zxl()//计算子矩阵最大子序列的和 
{
         int sum=0;
         int max=-100000;
         for(int i=0;i<n;i++)
         {
             sum+=s[i];
             if(sum>max)
                max=sum;
             if(sum<0)
		        sum=0;
         }
         return max;
}

int main()
{
    int a[110][110],max1;
    while(scanf("%d",&n)!=EOF)
    {
    	max1=-99999;
        for(int i=0;i<n;i++)
           for(int j=0;j<n;j++)
             scanf("%d",&a[i][j]);//输入矩阵 
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
                 s[j]=a[i][j];
            max1=zxl()>max1?zxl():max1;
            for(int j=i+1;j<n;j++)
            {
                for(int k=0;k<n;k++)
                 s[k]+=a[j][k];
                 max1=zxl()>max1?zxl():max1;
            }
        }
          printf("%d\n",max1);
    }
    return 0;
}