Maximum Sum 最大子矩阵和+dp+（最大连续子序列的变形）

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.
Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum. 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. A sub-rectangle is any contiguous sub-array of size 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 and Output
The input consists of an 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 integers separated by white-space (newlines and spaces). These integers make up the array in row-major order (i.e., all numbers on the first row, 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].
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的矩阵中找出它 的子矩阵的和最小，与最大连续子集类似。

思路：利用五层for循环对整个图进行遍历，找到符合题意子矩阵。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
    int a[105][105],b[105];
    int n,m,i,k,j,t;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        scanf("%d",&a[i][j]);
    int ans=a[0][0];
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        if(j>=i)
        {
            for(k=0;k<n;k++)
            {
                int sum=0;
                for(t=k;t<n;t++)
                {
                    int u;
                    for(u=i;u<=j;u++)
                    {
                        sum+=a[u][t];
                    }
                    if(sum>ans)
                        ans=sum;
                }
            }
        }
        printf("%d\n",ans);
        return 0;
}