小A的柱状图

https://ac.nowcoder.com/acm/contest/549/H 

思路：单调栈，处理最长的两边延申；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=3e6+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x;
        n>>=1;
        x=x*x;
    }
    return ans;
}

int l[maxn],r[maxn];
ll a[maxn],h[maxn];
ll sum[maxn];
stack<int>st;
int main()
{
    FASTIO;
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i],sum[i]=sum[i-1]+a[i];
    for(int i=1;i<=n;i++) cin>>h[i];
    l[1]=a[1];
    h[0]=0;
    st.push(0);
    st.push(1);
    for(int i=2;i<=n;i++)
    {
        while(h[st.top()]>=h[i])
        {
            st.pop();
        }
        l[i]=sum[i]-sum[st.top()];
        st.push(i);
    }
    while(!st.empty()) st.pop();
    h[n+1]=0;
    r[n]=a[n];
    sum[n+1]=sum[n];
    st.push(n+1);
    st.push(n);
    for(int i=n-1;i>=1;i--)
    {
        while(h[st.top()]>=h[i])
        {
            st.pop();
        }
        r[i]=sum[st.top()-1]-sum[i-1];
        st.push(i);
    }
    ll ans=0;
    for(int i=1;i<=n;i++)
    {
        //cout<<r[i]<<" ";
        ans=max(ans,h[i]*(l[i]+r[i]-a[i]));
    }
    cout<<ans<<endl;
    return 0;
}