Find the largest rectangular area possible in a given histogram where the largest rectangle can be made of a number of contiguous bars. For simplicity, assume that all bars have same width and the width is 1 unit.
For example, consider the following histogram with 7 bars of heights {6, 2, 5, 4, 5, 2, 6}. The largest possible rectangle possible is 12 (see the below figure, the max area rectangle is highlighted in red)
参考资料:
http://www.geeksforgeeks.org/largest-rectangle-under-histogram/
http://www.cnblogs.com/felixfang/p/3620086.html
http://www.cnblogs.com/felixfang/p/3676193.html
http://chuansong.me/n/400873436742
http://blog.youkuaiyun.com/yutianzuijin/article/details/52072427
探讨在给定直方图中寻找最大矩形面积的问题。假设所有条形宽度相同且为1单位,目标是最优地组合连续条形形成最大面积矩形。文章提供了几个参考资料链接,涵盖了解决该问题的不同方法。

905

被折叠的 条评论
为什么被折叠?



