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
题目题意:
题目给了n个矩形的高度,问最大连续矩形的公共面积(底乘以这段连续矩形中最短的高度),每个矩形的底都是1
基本思路:
遍历数组,以i点为当前序列的最低点,向两边扩展,显然只能扩展比i点高的点。然而如果不用任何优化,直接dp的话肯定超时(枚举每个起点和终点,矩形面积就是长*最小高度,O(N^3))。
所以我们用了两个数组L[ ],R[ ]来记录i点为最低点时序列的左右边界下标。显然,如果a[i]<=a [j-1] (j为左边界的下标),那么j肯定可以扩展到L[j-1],因为是单调递增序列。同理可以求出右边界。这样就减掉了许多多余的遍历。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
long long a[100005],r[100005],l[100005];
int main()
{
int n;
while(~scanf("%d",&n) && n)
{
for(int i=0; i<n; i++)
scanf("%lld",&a[i]);
l[0]=0;
r[n-1]=n-1;
for(int i=1; i<n; i++)
{
int j=i;
while(j>0&&a[i]<=a[j-1])
j=l[j-1];
l[i]=j;
}//这一步刚开始不太懂,之后我试着手动执行一遍,感觉好多了;以自身向前找几个,记录左边界下标。
for(int i=n-2; i>=0; i--)
{
int j=i;
while(j<n-1 && a[i]<=a[j+1])
j=r[j+1];
r[i]=j;
}//以自身向后找几个,记录右边界下标。
long long maxx=0;
for(int i=0; i<n; i++)
{
maxx=max(maxx,(r[i]-l[i]+1)*a[i]);
}
printf("%lld\n",maxx);
}
return 0;
}//如果感觉还是不懂,你也可以用2,1,4,3,5手写一遍。