三维动态规划 To The Max

最新推荐文章于 2024-07-24 23:08:35 发布

wyc_

最新推荐文章于 2024-07-24 23:08:35 发布

阅读量2.2k

点赞数

分类专栏：算法与数据结构

本文链接：https://blog.csdn.net/cumtwyc/article/details/41383781

版权

这道题目属于动态规划，探讨如何找到一个二维矩形区域（0, k）、(i, j)的边界内最大值。通过dp[i][j][k]表示这种状态，递归关系在于：如果一个矩形区域的最大值包含最下一行，那么去掉这行后，剩余部分仍是最大值。题目与一维的Maximum Subarray问题相似，可以作为理解动态规划维度的案例。同时提到了另一个三维动态规划题目Scramble String，通过这两个例子加深对动态规划中'对象'概念的理解。" 139439206,5683343,Postgres内核shared buffer初始化详解,"['数据库理论', 'PostgreSQL', '缓存技术', '内存管理', '数据结构']

摘要由CSDN通过智能技术生成

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8503 Accepted Submission(s): 4127

Problem Description

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: