本文介绍了一个利用单调栈解决求解最大矩形面积的问题。在给定的一系列矩形中，找到能够覆盖的面积最大的矩形，其宽度固定为1，高度各不相同。通过维护左右边界，使用单调栈来计算每个矩形可以覆盖的最远位置，从而求得最大面积。
https://cn.vjudge.net/contest/245662#problem
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of rectangles with the heights 2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles:
Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histo
最低0.47元/天 解锁文章
扫一扫
553
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
