PKU ACM 1050- to the max

题目来源：http://acm.pku.edu.cn/JudgeOnline/problem?id=1050

 

解题报告：

这道题是求二维子数组之和的最大值，详细的解释在编程之美2.15节有讲过，我的算法就是编程之美上提到的。

 

算法思路主要就是枚举行，设b[i][j]代表第j列中前i行的数据之和。那么，第m行到第n行间的第j列数据之和就是b[m][j]-b[n-1][j]。

这样按行枚举后，题目就转化为求一维子数组之和的最大值，这里的一维子数组就是行间的各个列的数据之和所组成的数组。

 

 

 #include <iostream> using namespace std; int a[101][101]; int b[102][102]; int main() { int N; cin >> N; int sum=0,max=0,all=0; for(int i=0;i<N;i++) { for(int j=0;j<N;j++) cin >> a[i][j]; } for(int j=0;j<N;j++) { b[1][j]=a[0][j]; b[0][j]=0; } for(int j=0;j<N;j++) { for(int i=2;i<=N;i++) b[i][j]=b[i-1][j]+a[i-1][j]; } for(int i=0;i<N;i++) { for(int j=i;j<N;j++) { all=b[j+1][0]-b[i][0]; sum=b[j+1][0]-b[i][0]; for(int k=1;k<N;k++) { if(sum<0) sum=0; sum+=b[j+1][k]-b[i][k]; if(sum>all) all=sum; } if(all>max) max=all; } } cout << max << endl; }

 

 

附录：

To the Max

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 20745		Accepted: 10727

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