GDUT寒假训练专题五 A - Largest Rectangle in a Histogram

文章描述了一种计算直方图中最大矩形面积的算法。每个直方图由一系列宽度为1的矩形组成,任务是找到这些矩形沿基线对齐时的最大面积。解决方案涉及到使用栈来跟踪高度递增的矩形序列,新矩形的高度由栈顶高度决定,直到遇到更矮的矩形才弹出栈顶元素。
摘要由CSDN通过智能技术生成

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 histogram.

Input

The input contains several test cases. Each test case describes a histogram and starts with an integer n, denoting the number of rectangles it is composed of. You may assume that 1<=n<=100000. Then follow n integers h1,...,hn, where 0<=hi<=1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. A zero follows the input for the last test case.

Output

For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.

大致题意:

思路:我们观察可以发现,长方形的高取决于被选中的最小高度,只有这个最矮的柱没有被选才可能使高度更高,所以我们可以用一个stack来维护一个高度递增的矩形序列。每次操作如下:

当进入一个新的矩形,我们就要不断弹出栈顶直到栈顶高度比现在矮,这样新的矩形的高度就等于栈顶的高度

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值