单调栈

题目：Largest Rectangle in a Histogram HDU - 1506

分析：

这个题就是求矩形的最大面积。其实就是求每个边所能水平延展的最大宽度（找到左右两侧第一个比他低的边，）

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int inf = 0x3f3f3f3f;
ll resl[maxn], resr[maxn];
int st1[maxn], st2[maxn], l1, l2;
ll a[maxn];
int n;

void init()
{
    l1 = l2 = 0;
}

int main()
{
    while(cin >> n, n)
    {
        init();
        for(int i = 1; i <= n; i++)
        {
            cin >> a[i];
            while(l1 && a[i] <= a[st1[l1]]) l1--;
            if(l1) resl[i] = st1[l1] + 1;
            else resl[i] = 1;
            st1[++l1] = i;
        }
        for(int i = n; i >= 1; i--)
        {
            while(l2 && a[i] <= a[st2[l2]]) l2--;
            if(l2) resr[i] = st2[l2] - 1;
            else resr[i] = n;
            st2[++l2] = i;
        }
        ll res = 0;
        for (int i = 1; i <= n; i++)
            res = max(res, a[i] * (resr[i] - resl[i] + 1));
        cout << res << endl;
    }
}