小A的柱状图（单调栈模拟）

链接：https://ac.nowcoder.com/acm/contest/549/H

这题数据弱的不得了，我改的代码各种数据错误都能过，比如

3

1 1 1

5 5 5 最后输出5或者10都过了，（！- -）

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000100
int a[N], n, k, h[N], w[N], s[N];
ll ans = 0;
 
int main() {
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for(int i = 1; i <= n; ++i) scanf("%d", &h[i]), ans = max(ans, (ll)h[i] * a[i]);
    int top = 0;
    a[n+1] = a[n];
    for(int i = 1; i <= n+1; ++i) {
            ll W = 0;
            while(top && h[s[top]] >= h[i]) {
                W += w[top];
                ans = max(ans, (ll)W * h[s[top]]);
                --top;
            }
            s[++top] = i; w[top] = W + a[i];
            //cout<<i<<" "<<top<<" "<<s[top]<<" "<<w[top]<<endl;
    }
    printf("%lld\n", ans);
}