寒假训练10-b

寒假训练10-b
（利用动态规划求最大子矩阵和）
问题：
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.
Sample Input
4
0 -2 -7 0 9 2 -6 2
-4 1 -4 1 -1
8 0 -2

Sample Output
15

问题简述：先输入一个数字n代表n阶方阵，接着输入矩阵各元素，找出其中元素和最大的子矩阵，求出其和。
问题分析：求最大子矩阵，与求最大连续子序列的和相似，利用动态规划进行求解。

程序说明：先将矩阵中第（i，j)个元素变成该列前i个元素之和，以此类推，创建出一个新的矩阵，对此矩阵进行动态规划，利用循环对行与行用减法，列与列之间用加法，利用max变量将最大值打印出。
代码如下：

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
     int dp[200][200],a[200][200], n;
     while (scanf_s("%d", &n) != EOF)
 {
     memset(dp, 0, sizeof(dp));
     int sum, max =0;
  for (int i = 1; i <= n; i++)
  {
      for (int j = 1; j <= n; j++)
   {
      cin >> a[i][j];
       dp[i][j] =a[i][j] + dp[i - 1][j];//**创建新的矩阵**
   }
  }
  for (int i = 1; i <= n; i++)
  {
   for (int j = i; j <= n; j++)
   {
      int sum1 = 0;
      for (int k = 1; k <= n; k++)
    {
       sum = dp[j][k] - dp[i - 1][k];//**进行动态规划**
       sum1 += sum;
       if (sum1 < 0)sum1 = 0;
       if (sum1 > max)max = sum1;
    }
   }
  }
    cout << max << endl;
 }
}