HDU - 1506 Largest Rectangle in a Histogram 单调栈

神秘链接 ┗|｀O′|┛ 嗷~~

在直方图中，找面积最大的矩形

---

---

#include <stdio.h>
#include <climits>
#include <cstring>
#include <time.h>
#include <math.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <vector>
#include <string>

#define INF 0x3f3f3f3f
#define ll long long
#define Pair pair<int,int>
#define re return

#define getLen(name,index) name[index].size()
#define mem(a,b) memset(a,b,sizeof(a))
#define Make(a,b) make_pair(a,b)
#define Push(num) push_back(num)
#define rep(index,star,finish) for(register int index=star;index<finish;index++)
#define drep(index,finish,star) for(register int index=finish;index>=star;index--)
using namespace std;
const int maxn=100000+5;

int store[maxn];
stack<int> S;
int main(){

    int len;
    while(scanf("%d",&len),len){
        rep(i,1,len+1)
            scanf("%d",&store[i]);

        store[len+1]=0;
        S.push(1);

        ll ans=-1;
        rep(i,2,len+2){
            while(!S.empty() && store[S.top()]>=store[i]){
                int pos=S.top();
                S.pop();
                ans=max(ans,store[pos]*1LL*(S.empty()? i-1:i-S.top()-1));
            }
            S.push(i);
        }

        printf("%lld\n",ans);
        while(!S.empty()){
            S.pop();
        }
    }

    re 0;
}