【BZOJ 3747 [POI2015]Kinoman】线段树优化暴力

BZOJ 3747
题意

做法 其实这个做法在去年省赛的时候就想到了 但是当时弊队只能想到n^2 暴力去查验
今天再次遇到 实际上讲一下
我们维护一个pre数组 代表这个数之前那次出现的下标
我们首先知道 一个电影他能产生贡献的范围就是 pre[i]+1 到 i
这就是首先一个区间加操作了
那么我们到这步电影 是不是要撤销上步电影的贡献呢？
就是 pre[pre[i]]+1 到 pre[i] 都要减去这些贡献
这样的话我们就可以外层一个n 枚举右端点 用线段树去优化 然后就可以取出最大值答案啦

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
ll Max(ll a,ll b){if(a>b) return a;return b;}
const int MAX_N = 1000025;
int arr[MAX_N],last[MAX_N],pre[MAX_N];
ll val[MAX_N],maxx[MAX_N<<2],col[MAX_N<<2];
void up(int rt)
{
    maxx[rt] = Max(maxx[rt<<1],maxx[rt<<1|1]);
}
void down(int rt,int l,int r)
{
    if(col[rt])
    {
        col[rt<<1] += col[rt];
        col[rt<<1|1] += col[rt];
        maxx[rt<<1] += col[rt];
        maxx[rt<<1|1] += col[rt];
        col[rt] = 0;
    }
}
void update(int rt,int l,int r,int x,int y,ll v)
{
    if(x<=l&&r<=y)
    {
        col[rt] += v;
        maxx[rt] += v;
        return ;
    }
    down(rt,l,r);
    if(y<=mid) update(rt<<1,l,mid,x,y,v);
    else if(x>mid) update(rt<<1|1,mid+1,r,x,y,v);
    else update(rt<<1,l,mid,x,y,v),update(rt<<1|1,mid+1,r,x,y,v);
    up(rt);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m;
    ll ans = 0;
    scanf("%d%d",&n,&m);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i]);
    for(int i = 1;i<=m;++i) scanf("%d",&val[i]);
    for(int i = 1;i<=n;++i) pre[i] = last[arr[i]],last[arr[i]] = i;
    for(int i = 1;i<=n;++i)
    {
        update(1,1,n,pre[i]+1,i,val[arr[i]]);
        if(pre[i]) update(1,1,n,pre[pre[i]]+1,pre[i],-val[arr[i]]);
        ans = Max(ans,maxx[1]);
    }
    printf("%lld\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}