Largest Rectangle in a Histogram

最新推荐文章于 2023-05-04 20:26:10 发布

zhengde152

最新推荐文章于 2023-05-04 20:26:10 发布

阅读量113

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/zhengde152/article/details/81428290

本文介绍了一种算法，用于解决寻找直方图中最大矩形面积的问题。该算法通过两次遍历直方图，分别从左至右确定每个矩形的左边界，以及从右至左确定每个矩形的右边界，最终找到最大的矩形面积。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Largest Rectangle in a Histogram

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.

Sample Input

7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0

Sample Output

8
4000

题解：找出每一个单位宽度矩形的左边界 l 和右边界 r ，左边界定义为左边连续的高度大于等于它的最左边的矩形的下标，右边界同理，从左往右推出所有的左边界，从右往左推出所有的右边界。

注意：矩形的高度h可以等于零，以为这当左边边上的矩形高为零或者右边边界上矩形高度为零时，while循环无法停止，所以在 while循环的条件中要加上限制边界的条件。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
long long int a[100010],l[100010],r[100010];
int main()
{
	int n;
	while(~scanf("%d",&n)&&n)
	{
		int i,j;
		long long int maxx=-1,sum;
		for(i=1;i<=n;i++)
		  scanf("%lld",&a[i]);
		l[1]=1;r[n]=n;
		for(i=2;i<=n;i++)//找当前矩形左边能延伸到的矩形，第几个，下标
		{
			int tt=i;
			while(tt>1&&a[i]<=a[tt-1])
			   tt=l[tt-1];
			l[i]=tt;
		}
		for(i=n-1;i>=1;i--)//找当前矩形右边能够延伸到的矩形，第几个，下标
		{
		    int tt=i;
			while(tt<n&&a[i]<=a[tt+1])	
		      tt=r[tt+1];
			r[i]=tt;
		}
		for(i=1;i<=n;i++)
		{
			sum=(r[i]-l[i]+1)*a[i];
			  if(sum>maxx)//更新最大值 
			  maxx=sum;
		}
		printf("%lld\n",maxx);
	}   
 }