1092: To the Max 最大子矩阵

最新推荐文章于 2021-08-22 11:56:00 发布

kongming_acm

最新推荐文章于 2021-08-22 11:56:00 发布

阅读量530

点赞数

分类专栏： joj acm_动态规划文章标签： numbers whitespace input integer output ini

本文链接：https://blog.csdn.net/kongming_acm/article/details/5725917

版权

joj acm_动态规划专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一个寻找二维数组中最大子矩阵和的算法问题，包括输入输出格式、样例及核心算法实现。通过扫描行累加值并动态规划求解最大连续子序列和，最终找到具有最大和的子矩阵。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1092: To the Max

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1256	268	Standard

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.

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

This problem is used for contest: 35

#include<stdio.h>
int main()
{
    int n,i,j,k;
    int a[505][505];
    while(scanf("%d",&n)==1)
    {
        for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&a[i][j]);
        int max=(1<<31);
        for(i=0;i<n;i++)
        {
            int f[500]={0};
            for(j=i;j<n;j++)
            {
                int b=0;
                for(k=0;k<n;k++) f[k]+=a[k][j];
                for(k=0;k<n;k++)
                {
                    if(b>0) b+=f[k];
                    else b=f[k];
                    if(b>max) max=b;
                }
            }
        }
        printf("%d/n",max);
    }
    return 0;
}