问题:
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
思路:
从一个长方形出发,找出最远的到右边和到左边的他高的长方形的坐标距离,然后左右距离之差就是这个高度在这个范围内所能组成的面积最大的长方形。
代码:
#define N 100010
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
typedef long long ll;
using namespace std;
int n,dp[N],a[N],b[N];
ll k[N];
int main()
{
while(cin>>n&&n)
{
for(int i=1; i<=n; i++)
cin>>k[i];
ll ma=0;a[1]=1;b[n]=n;
for(int i=2; i<=n; i++)//找出这个位置,左边大于等于自己的长度
{
int t=i;
while(t>1&&k[i]<=k[t-1])
t=a[t-1];
a[i]=t;
}
for(int i=n-1; i>=1; i--)//找出右边
{
int t=i;
while(t<n&&k[i]<=k[t+1])
t=b[t+1];
b[i]=t;
}
for(int i=1; i<=n; i++)//找出最大面积
{
if((b[i]-a[i]+1)*k[i]>ma)
ma=(b[i]-a[i]+1)*k[i];
}
cout<<ma<<endl;
}
return 0;
}