Largest Rectangle in a Histogram(单调栈)

原创 2015年07月07日 23:23:34

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

Hint
Huge input, scanf is recommended.

Difficulty:单调栈:栈内的元素,按照某种方式排序下(单调递增或者单调递减) 如果新入栈的元素破坏了单调性,就弹出栈内元素,直到满足单调性
模板:
int top=0,s[maxn];
for(int i=1;i<=n;i++)
{while(top&&h[s[top]]>=h[i])//根据改变大于号小于号来改变单调性。
{--top;}//出栈,一般在while这重循环里添加东西去满足题意。
s[++top]=i;}//入栈

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cstdlib>
#include<algorithm>
using namespace std;
long long h[100006];
int  s[100006];
long long area[100006];
int L[100006];
int R[100006];
int n;
long long ans;
bool cmp( int a, int c)
{
    return  a>c;

}
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        int top=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%lld",&h[i]);
            while(top&&h[s[top]]>=h[i])
                --top;
            L[i]=(top==0?1:s[top]+1);
            s[++top]=i;
        }
        for(int i=1;i<=n;i++)
        //printf("%d ",L[i]);printf("\n");
        top=0;
        for(int i=n;i>=1;i--)
        {while(top&&h[s[top]]>=h[i])
               --top;
            R[i]=(top==0?n:s[top]-1);
            s[++top]=i;
        }
        ans=-1;
        //for(int i=1;i<=n;i++)
        //printf("%d ",R[i]);}
        for(int i=1;i<=n;i++)
        {area[i]=h[i]*(R[i]-L[i]+1);
        //sort(area+1,area+n+1,cmp);
        if(ans<area[i])
        ans=area[i];}
        printf("%lld\n",ans);}
        return 0;
}

[POJ 2559 Largest Rectangle in a Histogram] 单调栈

[POJ 2559 Largest Rectangle in a Histogram] 单调栈题目链接:[POJ 2559 Largest Rectangle in a Histogram] 题意...

HDU 1506 Largest Rectangle in a Histogram 单调栈

Largest Rectangle in a Histogram A histogram is a polygon composed of a sequence of rectangles alig...

hdu 1506(nyoj 258)Largest Rectangle in a Histogram(最大长方形(二))(单调栈)

hdu题目链接:Largest Rectangle in a Histogram nyoj题目链接:最大长方形(二)思路一: 用三个数组记录,height[]记录高度,left[]记录当前高度延伸...

HDU 1506 Largest Rectangle in a Histogram(DP·单调栈)

Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768...
  • acvay
  • acvay
  • 2014年09月02日 09:50
  • 481

hdu1506 Largest Rectangle in a Histogram (单调栈)

lef[i],rig[i]分别保存第i个矩形向左和向右分别能扩展多远。 以向右扩展为例: 从左向右枚举每一个矩形i,如果高度height[i]大于等于栈顶元素的高度或栈为空,入栈。 若heigh...

单调栈优化dp:hdu1506Largest Rectangle in a Histogram &hdu1505city game dp

其实早在去年九月就做过这两个题了 hdu1506Largest Rectangle in a Histogram hdu1505city game dp 然而并不是用单调栈来优化的,一个很不好理...

POJ2559 - Largest Rectangle in a Histogram - 单调栈+DP

1.题目描述: Largest Rectangle in a Histogram Time Limit: 1000MS   Memory Limit: 65536K Total Sub...

POJ 2559 Largest Rectangle in a Histogram --维护单调栈

相当于对于当前点 i ,求向左和向右分别能延伸到的位置 l[i], r[i],然后最后求 MAX(h[i] * (r[i]-l[i]) ).意思是向两边找到比它矮的位置为止.至于为什么比他矮就不能延伸...

HDU-1506 Largest Rectangle in a Histogram(单调栈)

Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768...

POJ 2559 / HDU 1506 / LightOJ 1083 Largest Rectangle in a Histogram (单调栈)

Largest Rectangle in a Histogram http://poj.org/problem?id=2559 Time Limit: 1000MS Memory Limit:...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Largest Rectangle in a Histogram(单调栈)
举报原因:
原因补充:

(最多只允许输入30个字)