2019牛客暑期多校训练营（第四场）C 单调栈&&线段树

题意：

题解：l和r我用dp求得，跟单调栈思路差不多，但是好写

这里有两个问题

1.我一开始用rmq的stp表查询最值，结果这种用空间换时间的做法mle了，因为维数有25维，正好被卡掉了

后来只能用线段树查询最值

2.为了让b[i]包括在区间内，我查询的区间并不是跟题解上一样的，我查的区间是l-1....i-1和i....r，然后这样会出现一个问题，一个是

l==i时查询就会出问题，第二个是i==1时也会出问题，这时候就得单独判断一下

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int maxn= 3e6+100;
const ll INFF =1e18;
const int INF =1e9;
int l[maxn],r[maxn];
int a[maxn],b[maxn];
ll sum[maxn],t1[maxn<<2],t2[maxn<<2];
int n;
inline int ls(int p){return p<<1;}
inline int rs(int p){return p<<1|1;}
void push_up_max(int p){
    t1[p]=max(t1[ls(p)],t1[rs(p)]);
}
void push_up_min(int p){
    t2[p]=min(t2[ls(p)],t2[rs(p)]);
}
void build(int p,int l,int r){
    if(l==r){t1[p]=sum[l];t2[p]=sum[l];return;}
    int mid=(l+r)>>1;
    build(ls(p),l,mid);
    build(rs(p),mid+1,r);
    push_up_max(p);
    push_up_min(p);
}
ll query1(int q_x,int q_y,int l,int r,int p){
    ll res=0;
    if(q_x<=l&&r<=q_y)return t1[p];
    int mid=(l+r)>>1;
    if(q_x<=mid)res=max(res,query1(q_x,q_y,l,mid,ls(p)));
    if(q_y>mid)res=max(res,query1(q_x,q_y,mid+1,r,rs(p)));
    return res;
}
ll query2(int q_x,int q_y,int l,int r,int p){
    ll res=INFF;
    if(q_x<=l&&r<=q_y)return t2[p];
    int mid=(l+r)>>1;
    if(q_x<=mid)res=min(res,query2(q_x,q_y,l,mid,ls(p)));
    if(q_y>mid)res=min(res,query2(q_x,q_y,mid+1,r,rs(p)));
    return res;
}
int main(){
    //freopen("input.in", "r", stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        l[i]=i,r[i]=i;
    }
    sum[0]=0;
    for(int i=1;i<=n;i++){
        scanf("%d",&b[i]);
        sum[i]=sum[i-1]+b[i];
    }
    l[0]=1;r[n+1]=n;a[0]=-INF;a[n+1]=-INF;
    for(int i=1;i<=n;i++){
        while(a[i]<=a[l[i]-1])
            l[i]=l[l[i]-1];
    }
    for(int i=n;i>=1;i--){
        while(a[i]<=a[r[i]+1])
            r[i]=r[r[i]+1];
    }
    build(1,1,n);
    ll ans=-INFF;
    for(int i=1;i<=n;i++){
        if(a[i]<0){
            ll tmp;
            if(i==l[i])
                tmp=query2(i,r[i],1,n,1)-sum[i-1];
            else{
                tmp=query2(i,r[i],1,n,1)-((l[i]-1==0)?max(1ll*0,query1(l[i],i-1,1,n,1)):query1(l[i]-1,i-1,1,n,1));
                }
            ans=max(tmp*a[i],ans);   
        }else {
            ll tmp;
            if(i==l[i])
                tmp=query1(i,r[i],1,n,1)-sum[i-1];
            else
                tmp=query1(i,r[i],1,n,1)-(l[i]-1==0)?min(query2(l[i],i-1,1,n,1),1ll*0):query2(l[i]-1,i-1,1,n,1);
            ans=max(tmp*a[i],ans);
        }
    }
    cout<<ans<<endl;
    return 0;
}