寒假训练的一道题：

To The Max

TimeLimit: 1 Second   MemoryLimit: 32 Megabyte

Totalsubmit: 5   Accepted: 4  

Description

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.

Input

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.

开始觉得挺无解的，后来仔细一想 ，其实就是一道最大子序和，以下是代码：

#include<stdio.h>
#include<string.h>
#define INF -100000
int n,a[105][105],ans[105];
int max;
int sloution(){
    int sum=0;
    for(int i=0;i<n;i++){
        sum+=ans[i];
        if(sum>max)
        max=sum;
        if(sum<0)
        sum=0;
    }
    return max;
}
int main(){
    int i,j,k;
    int num;
    while(scanf("%d",&n)!=EOF){
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                scanf("%d",&a[i][j]);
            }
        }
        max=INF;
        for(i=0;i<n;i++){
            memset(ans,0,sizeof(ans));
            for(j=i;j<n;j++){
                for(k=0;k<n;k++){
                    ans[k]+=a[j][k];
                }
                num=sloution();
            }
        }
        printf("%d\n",max);
    }
    return 0;
}