51nod 1102 面积最大的矩形

单调栈

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cstdlib>
#include<string.h>
#include<iomanip>

#define ll long long
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define inf 0x3f3f3f3f
#define eps 1e-6
const int mod = 1e9 + 7;
const int maxn = 1e3 + 10;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;

ll gcd(ll p, ll q) { return q == 0 ? p : gcd(q, p % q); }

using namespace std;
const int N = 1e5 + 10;

int n;
struct node {
    ll h, id;
}a[N];
stack<node> s;
int main() {
    cin>>n;
    for(int i=0;i<n;i++)
        cin >> a[i].h,a[i].id=i;
    a[n].id=n;a[n].h=0;

    ll ans = 0;
    for(int i=0;i<=n;i++){
        while(!s.empty() && a[i].h <= s.top().h){
            ll cur = s.top().h;s.pop();
            ans = max(ans,cur * (s.empty() ? i : a[i].id - s.top().id-1));
        }
        s.push(a[i]);
    }

    cout<< ans <<endl;
    return 0;
}