问题:
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
题意: 给你一个条形图,每个条形图的宽度都为1,如上图,要你求出其最大矩形.....
思路:很经典的一道题,可以用单调栈分别求出每个柱子左右两边第一个比它低的柱子(也就相当于求出了和它相连的最后一个比它高的柱子),确定每个柱子的左右边界,每个柱子的高度乘上左右边界的宽度求最大值就行了。
代码:
#include<stdio.h>
#include<stack>
#include<string.h>
#include<algorithm>
using namespace std;
long long a[100100],right[100100],left[100100];
stack<int>q;
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
for(int i=1; i<=n; i++)
scanf("%lld",&a[i]);
for(int i=1; i<=n; i++)
right[i]=left[i]=i;
a[0]=a[n+1]=-1;
while(!q.empty())q.pop();
for(int i=1; i<=n+1; i++)//记录右边界;
{
while(!q.empty())
{
if(a[i]<a[q.top()])
{
right[q.top()]=i;
q.pop();
}
else
break;
}
q.push(i);
}
while(!q.empty())q.pop();
for(int i=n; i>=0; i--)//记录左边界;
{
while(!q.empty())
{
if(a[i]<a[q.top()])
{
left[q.top()]=i;
q.pop();
}
else
break;
}
q.push(i);
}
long long maxx=-1;
for(int i=1; i<=n; i++)//将右边界-左边界-1再乘以高即可;
maxx=max(maxx,a[i]*(right[i]-left[i]-1));
printf("%lld\n",maxx);
}
return 0;
}