GDUT_22级专题五 A - 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

Inputcopy	Outputcopy
7 2 1 4 5 1 3 3 4 1000 1000 1000 1000 0	8 4000

思路：

参考题解：【C++】【单调栈】剑指 Offer II 039. 直方图最大矩形面积 题解：单调栈 | 哨兵技巧 - 直方图最大矩形面积 - 力扣（LeetCode）

利用单调栈，从左到右遍历矩形，遇到比栈顶高的入栈，比栈顶低的出栈并更新答案，最后在从右到左遍历一次。

代码：

#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
typedef double db;

ll a[100005];
vector<int> q;
int main(){
	std::ios::sync_with_stdio(false);
    ll n;
    ll temp;
    scanf("%lld",&n);
    while(n!=0){
        memset(a,0,sizeof(a));
        while(q.empty()==0) q.pop_back();
        ll maxnum=0;
        for(int i=1;i<=n;i++){
            scanf("%lld",&a[i]);      
        }
        a[0]=0;
        a[n+1]=0;
        q.push_back(0);
        int tag=0,tagb;
        for(int i=1;i<=n+1;i++){
            tag=q.back();
            if(a[tag]<=a[i]){
                q.push_back(i);
            }else if(a[tag]>a[i]){
                do{
                    q.pop_back();
                    tagb=q.back();
                    temp=a[tag]*(i-tagb-1);
                    maxnum=max(temp,maxnum);
                    tag=tagb;
                }while(a[tag]>a[i]);
                q.push_back(i);
            }
        }
        maxnum=max(maxnum,n);
        while(q.empty()==0) q.pop_back();
        a[0]=0;
        a[n+1]=0;
        q.push_back(0);
        tag=0;
        for(int i=n;i>=0;i--){
            tag=q.back();
            if(a[tag]<=a[i]){
                q.push_back(i);
            }else if(a[tag]>a[i]){
                do{
                    q.pop_back();
                    tagb=q.back();
                    temp=a[tag]*((i-tagb)*-1-1);
                    maxnum=max(temp,maxnum);
                    tag=tagb; 
                }while(a[tag]>a[i]);
                q.push_back(i);
            }
        }
        maxnum=max(maxnum,n);
        cout<<maxnum<<endl;
        scanf("%lld",&n);
    }
    return 0;
}