Maximum Sum

Maximum Sum

A problem that is simple to solve in one dimension is often much more difficult to solve in more than one dimension. Consider satisfying a boolean expression in conjunctive normal form in which each conjunct consists of exactly 3 disjuncts. This problem (3-SAT) is NP-complete. The problem 2-SAT is solved quite efficiently, however. In contrast, some problems belong to the same complexity class regardless of the dimensionality of the problem.
Givena2-dimensionalarrayofpositiveandnegativeintegers,findthesub-rectanglewiththelargest sum. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the subrectangle with the largest sum is referred to as the maximal sub-rectangle.
A sub-rectangle is any contiguous sub-array of size 1×1 or greater located within the whole array. 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-hand corner:
9 2
−4 1
−1 8
and has the 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 N2 integers separated by white-space (newlines and spaces). These N2 integersmakeupthearrayinrow-majororder(i.e., allnumbersonthefirstrow,left-to-right, then all numbers on 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
The output is 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

题意：
给你一个n*n的矩阵，找出一个矩形，使这个矩形内的数字和加起来最大。
代码:

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[110][110];
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
        {
            int x;
            scanf("%d",&x);
            a[i][j]=a[i-1][j]+x;
        }
        int s=-999999999;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(i<=j)
                {
                    int f[110]={0};
                    for(int k=1;k<=n;k++)
                    {
                        int l=a[j][k]-a[i-1][k];
                        f[k]=max(f[k-1]+l,l);
                        s=max(s,f[k]);
                    }
                }
            }
        }
        printf("%d\n",s);
    }
    return 0;
}