bzoj3747

线段树

线段树记录到每个位置截止的答案

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 5;
int n, m;
ll ans;
int nxt[N], last[N], a[N], b[N], vis[N];
ll mx[N << 2], tag[N << 2];
void pushdown(int x)
{
    if(!tag[x]) return;
    tag[x << 1] += tag[x];
    tag[x << 1 | 1] += tag[x];
    mx[x << 1] += tag[x];
    mx[x << 1 | 1] += tag[x];
    tag[x] = 0;
}
void update(int l, int r, int x, int a, int b, int d)
{
    if(l > b || r < a) return;
    if(l >= a && r <= b) 
    {
        mx[x] += d;
        tag[x] += d;
        return;
    }
    pushdown(x);
    int mid = (l + r) >> 1;
    update(l, mid, x << 1, a, b, d);
    update(mid + 1, r, x << 1 | 1, a, b, d);
    mx[x] = max(mx[x << 1], mx[x << 1 | 1]);
}
int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i) 
    {
        scanf("%d", &a[i]);
        if(last[a[i]]) nxt[last[a[i]]] = i; 
        last[a[i]] = i;
    }
    for(int i = 1; i <= m; ++i) scanf("%d", &b[i]);
    for(int i = 1; i <= n; ++i) if(!vis[a[i]]) 
    {
        update(1, n, 1, i, nxt[i] ? nxt[i] - 1 : n, b[a[i]]);
        vis[a[i]] = 1;
    }
    for(int i = 1; i <= n; ++i) 
    {
        ans = max(ans, mx[1]);
        update(1, n, 1, i, nxt[i] ? nxt[i] - 1 : n, -b[a[i]]);
        if(nxt[i]) update(1, n, 1, nxt[i], nxt[nxt[i]] ? nxt[nxt[i]] - 1 : n, b[a[i]]); 
    }
    printf("%lld\n", ans);
    return 0;
}

View Code

 

转载于:https://www.cnblogs.com/19992147orz/p/8269909.html