POJ 1050 To the Max

最新推荐文章于 2021-03-16 22:55:08 发布

isunLt

最新推荐文章于 2021-03-16 22:55:08 发布

阅读量279

点赞数

分类专栏： POJ 文章标签： POJ

本文链接：https://blog.csdn.net/isunlt/article/details/88605621

版权

POJ 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

POJ 1050 To the Max

描述

Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*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:

is in the lower left corner:

9 2
-4 1
-1 8

and has a sum of 15.

输入

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² integers separated by whitespace (spaces and newlines). These are the N² 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 500. The numbers in the array will be in the range [-127,127].

输出

Output the sum of the maximal sub-rectangle.

样例输入

 4
0 -2 -7 0 9 2 -6 2
-4 1 -4 1 -1 8  0 -2

样例输出

Code:

#include<iostream>
#include<cstdio>
#include<vector>
#include<limits>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;

int main()
{
	int n; scanf("%d", &n);
	vector<vector<int>> mat(n+1, vector<int>(n+1,0)), sum(n+1, vector<int>(n+1,0));
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			scanf("%d", &mat[i][j]);
			sum[i][j] = sum[i - 1][j] + mat[i][j];
		}
	}
	int ans = INT32_MIN;
	for (int i = 1; i <= n; i++) // 子矩阵左下角的行数从第i行开始
	{ 
		for (int j = i; j <= n; j++) // 子矩阵右上角的行数从i开始到最后一行
		{ 
			int max1 = 0; //max1 表示当子矩阵左上角行数是i时, 以(j,k)为右上角的子矩阵和的最大值
			for (int k = 1; k <= n; k++) // 子矩阵右上角的列数从第1列开始到最后一列
			{
				int temp = sum[j][k] - sum[i-1][k];
				if (temp + max1 > 0) max1 = temp + max1;
				else max1 = (temp > 0 ? temp : 0);
				ans = max(max1, ans);
			}
		}
	}
	printf("%d\n", ans);
	return 0;
}