HDU 1506 Largest Rectangle in a Histogram（dp）

Largest Rectangle in a Histogram

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

Problem Description

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

找最大矩形面积，以i为中心向两边找高度大于i的，求面积，寻找最大值

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[100005];
int l[100005];
int r[100005];
int main()
{
	int n;
	while(~scanf("%d",&n)&&n)
	{
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			l[i]=r[i]=i;
		}
		a[0]=a[n+1]=-1;
		for(int i=1;i<=n;i++)
		{
			int j=i-1;
			while(a[j]>=a[i])
			{
				j=l[j]-1;
			}
			l[i]=j+1;//大于a[i]的最终左位置 
		}
		for(int i=n;i>0;i--)
		{//正序超时 
			int j=i+1;
			while(a[j]>=a[i])
			{
				j=r[j]+1;
			}
			r[i]=j-1;//大于a[i]的最终右位置 
		}
		long long sum=0;
		for(int i=1;i<=n;i++)//计算以a[i]为中心的矩形面积 
			sum=max(sum,(long long)(r[i]-l[i]+1)*a[i]);
		printf("%lld\n",sum);//输出最大值 
	}
	return 0;
}