To the Max（ACM）最大和矩阵

To the Max

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB

Total submit users: 926, Accepted users: 794

Problem 10102 : No special judgement

Problem 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 <iostream>
#include <string.h>
#define MIN 0x80000000;
using namespace std;
int a[101][101];
int OneDimSub(int array[],int n){
	int get=0,max=MIN;
	for(int i=0;i<n;i++){
		if(get>0)  
			get=get+array[i];
		else
			get=array[i];
		if(get>max) max=get;
	}
	return max;
}
int solve(int n){
	int array[n];
	int i,j,k,p,max,get;
	max=MIN;
	for(i=0;i<n;i++){
		for(j=i;j<n;j++){
			//缩小成为一维 
			memset(array,0,4*n);
			for(k=i;k<=j;k++){
				for(p=0;p<n;p++)
					array[p]+=a[k][p];
			}
			//解决一维数组最大子段和
			get=OneDimSub(array,n);
			if(get>max) max=get;
		}
	}
	return max;
}
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++)
			cin>>a[i][j];
	}
	cout<<solve(n);
	return 0;
}