URAL 1146. Maximum Sum[DP最大子矩阵和]

最新推荐文章于 2019-04-12 13:32:40 发布

Whowell

最新推荐文章于 2019-04-12 13:32:40 发布

阅读量171

点赞数

分类专栏：动态规划---------URAL DP专题动态规划

本文链接：https://blog.csdn.net/weixin_39792252/article/details/80231429

版权

动态规划同时被 2 个专栏收录

64 篇文章 0 订阅

订阅专栏

动态规划---------URAL DP专题

29 篇文章 0 订阅

订阅专栏

1146. Maximum Sum

Time limit: 0.5 second
Memory limit: 64 MB

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 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 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 N 2 integers separated by white-space (newlines and spaces). These N 2 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].

Output

The output is the sum of the maximal sub-rectangle.

Sample

input	output
4 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2	15

Tags: dynamic programming ( hide tags for unsolved problems)

Difficulty: 87 Printable version Submit solution Discussion (37)
All submissions (18903) All accepted submissions (6654) Solutions rating (4818)

求最大子矩阵和，直接枚举四个端点时间复杂度有点大，所以转换成最大字段和，

sum[i][j]保存第i行第j列中前j个的和。。。。

枚举上下行r1,r2,然后就是求最大字段和啦。。。

#include<bits/stdc++.h>
#define ll long long

using namespace std;
const int maxn = 1e2+7;

int n, m[maxn][maxn], sum[maxn][maxn];

void clomn()
{
    memset(sum, 0, sizeof(sum));
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
           sum[i][j] = sum[i - 1][j] + m[i][j];
}

int solve()
{
    clomn();
    int ans = -10000;
    for(int r1 = 1; r1 <= n; r1++)
        for(int r2 = r1; r2 <= n; r2++)
        {
            int t = 0;
            for(int i = 1; i <= n; i++)
            {
                t += sum[r2][i] - sum[r1 - 1][i];
                ans = max(t, ans);
                if(t < 0) t = 0;
            }
        }
    return ans;
}


int main()
{
    //freopen("in.txt", "r", stdin);
    while(~scanf("%d",&n))
    {
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++) scanf("%d",&m[i][j]);
        printf("%d\n", solve());
    }
    return 0;
}