splay学习笔记

记录splay的区间操作之区间加法

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N = 1e5+10,INF = 1e9;
int w[N];
struct node{
    int s[2],p,v;
    int size;
    ll add,sum;
    void init(int _p,int _v){
        p = _p;
        v = _v;
        size = 1;
        add = 0;
        sum = 0;
    }
}tr[N];
int root,idx;
void pushup(int x){
    tr[x].size = tr[tr[x].s[0]].size + tr[tr[x].s[1]].size + 1;
    tr[x].sum = tr[tr[x].s[0]].sum + tr[tr[x].s[1]].sum+tr[x].v;
}
void pushdown(int x){
    if(tr[x].add){
        tr[tr[x].s[0]].add += tr[x].add;
        tr[tr[x].s[1]].add += tr[x].add;
        tr[tr[x].s[0]].sum += tr[x].add * tr[tr[x].s[0]].size;
        tr[tr[x].s[1]].sum += tr[x].add * tr[tr[x].s[1]].size;
        tr[x].v += tr[x].add;
        tr[x].add = 0;
    }
}
void rotate(int x){
    int y = tr[x].p,z = tr[y].p;
    int k = tr[y].s[1] == x;
    tr[z].s[tr[z].s[1] == y] = x;
    tr[x].p = z;
    tr[y].s[k] = tr[x].s[k^1];
    tr[tr[x].s[k^1]].p = y;
    tr[x].s[k^1] = y;
    tr[y].p = x;
    pushup(y);
    pushup(x);
}
void splay(int x,int k){
    while(tr[x].p != k){
        int y = tr[x].p,z = tr[y].p;
        if(z != k)
            if((tr[y].s[1] == x)^(tr[z].s[1] == y)) rotate(x);
            else rotate(y);
        rotate(x);
    }
    if(!k) root = x;
}
int build(int p,int l,int r){
    if(l > r) return 0;
    int mid = l + r >> 1;
    int u = ++idx;
    tr[u].init(p,w[mid]);
    tr[u].s[0] = build(u,l,mid-1);
    tr[u].s[1] = build(u,mid+1,r);
    pushup(u);
    return u;
}
int get_k(int k){
    int u = root;
    while(1){
        pushdown(u);
        if(tr[tr[u].s[0]].size >= k) u = tr[u].s[0];
        else if(tr[tr[u].s[0]].size + 1 == k) return u;
        else k-=tr[tr[u].s[0]].size + 1,u = tr[u].s[1];
    }
    return -1;
}
void write(int u){
    //pushdown(u);
    if(tr[u].s[0]) write(tr[u].s[0]);
    cout<<tr[u].v<<" ";
    if(tr[u].s[1]) write(tr[u].s[1]);
}
int main(){
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=n;i++) cin>>w[i];
    root = build(0,0,n+1);
    char op;
    int l,r,d;
    while(m--){
        cin>>op>>l>>r;
        l = get_k(l);
        r = get_k(r+2);
        splay(l,0);
        splay(r,l);
         if(op == 'C'){
            cin>>d;
            tr[tr[r].s[0]].add += d;
            tr[tr[r].s[0]].sum += d*tr[tr[r].s[0]].size;
            pushup(r);
            pushup(l);
         }else{
            cout<<tr[tr[r].s[0]].sum<<endl;
         }
    }
    return 0;
}

注：1、splay维护s是一个区间时应该使用build函数
2、记住pushdown操作和splay操作