luogu 3582 线段树

线段树内存下mx[k]的值是动态的1-i这个区间的贡献答案

实际上点存的就是区间答案，但用max是为了求最大区间答案（有可能虽然贡献被消除但后来有更大的贡献填补答案空缺）

#include<bits/stdc++.h>
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define dec(i,x,y) for(register int i=x;i>=y;i--)
#define LL long long
#define In freopen("7.in","r",stdin)
#define In2 freopen("8.in","r",stdin)
using namespace std;
const int N=1e6+;
inline int read(){
    int x=,f=;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-;ch=getchar();}
    while(isdigit(ch)){x=(x<<)+(x<<)+(ch^);ch=getchar();}
    return x*f;}
int n,m,w[N],f[N],mark[N],pre[N];
LL mx[N<<],tag[N<<],ans=;
inline void pushup(int k){
    mx[k]=max(mx[k<<],mx[k<<|]);}
inline void pushdown(int k,int l,int r,int mid){
    if(l==r) return;
    LL v=tag[k];tag[k]=;
    tag[k<<]+=v;mx[k<<]+=v;
    tag[k<<|]+=v;mx[k<<|]+=v;}
inline void change(int k,int l,int r,int x,int y,LL d){
    if(x<=l&&r<=y){
        tag[k]+=d;mx[k]+=d;return;}
    int mid=(l+r)>>;
    if(tag[k]) pushdown(k,l,r,mid);
    if(x<=mid) change(k<<,l,mid,x,y,d);
    if(mid<y) change(k<<|,mid+,r,x,y,d);
    pushup(k);
}
inline LL query(int k,int l,int r,int x,int y){
    if(x<=l&&r<=y) return mx[k];LL res=;
    int mid=(l+r)>>;if(tag[k])pushdown(k,l,r,mid);
    if(x<=mid) res=max(res,query(k<<,l,mid,x,y));
    if(mid<y) res=max(res,query(k<<|,mid+,r,x,y));
    return mx[k];}
int main(){
    n=read();m=read();
    rep(i,,n) f[i]=read();
    rep(i,,m) w[i]=read();
    rep(i,,n) pre[i]=mark[f[i]],mark[f[i]]=i;

    rep(i,,n){
        change(,,n,pre[i]+,i,w[f[i]]);
        if(pre[i]) change(,,n,pre[pre[i]]+,pre[i],-w[f[i]]);
        ans=max(ans,query(,,n,,i));
    }
    printf("%lld\n",ans);return ;
}