算法实验（动态规划-12-16题）1
需积分: 0 112 浏览量
2022-08-03
14:15:46
上传
评论
收藏 247KB PDF 举报
动态规划题目较多，灵活多变，技巧性较强，还有针对不
同的结构的变形，应多刷点题目练习练习。不过动态规划也是
有基本套路的，熟能生巧。
第 12 题：poj1050 To the Max
To the Max
Description
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:
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 * 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].
评论0