POJ3468 splay

线段树/树状数组裸题，用splay写

splay也是基本操作pushup pushdown

话说我就是找不到全一点的模板，我自己写又全是bug，导致代码风格一直变来变去= =

关键是建树和区间操作（区间和，区间翻转，区间合并这几个写法都很难统一）

#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define C 0.5772156649
#define pi acos(-1.0)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1

using namespace std;
using namespace __gnu_cxx;

const double g=10.0,eps=1e-;
const int N=+,maxn=+,inf=0x3f3f3f;

struct Node{
    Node *ch[],*fa;
    int id,s,v,add;
    ll sum;
    void pushdown()
    {
        if(add)
        {
            if(ch[])
            {
                ch[]->v += add;
                ch[]->add += add;
                ch[]->sum += (ll)add*ch[]->s;
            }
            if(ch[])
            {
                ch[]->v += add;
                ch[]->add += add;
                ch[]->sum += (ll)add*ch[]->s;
            }
            add=;
        }
    }
    void pushup()
    {
        s = ch[]->s + ch[]->s + ;
        sum = v + ch[]->sum + ch[]->sum;
    }
};
Node *root,NODE[N],*null=&NODE[];
int num[N],n,top;
struct SplayTree{
    void Rotate(Node *x,int f)
    {
        Node* y= x->fa;
        y->pushdown();x->pushdown();
        y->ch[!f] = x->ch[f];
        x->ch[f]->fa = y;
        x->fa = y->fa;
        if(x->fa!=null)y->fa->ch[y->fa->ch[]==y]=x;
        x->ch[f] = y;
        y->fa=x;
        y->pushup();
    }
    void splay(Node* x,Node* goal)//把x splay到goal下面
    {
        x->pushdown();
        while(x->fa!=goal)
        {
            if(x->fa->fa == goal)Rotate(x,x->fa->ch[]==x);
            else
            {
                Node *y=x->fa,*z=y->fa;
                int f=(z->ch[]==y);
                y->ch[f]==x ? Rotate(x,!f):Rotate(y,f);
                Rotate(x,f);
            }
        }
        x->pushup();
        if(goal==null)root=x;
    }
    void RTO(int k,Node *goal)//把排名为k的节点splay到goal下面
    {
        Node *x=root;
        x->pushdown();
        while(x->ch[]->s+!=k)
        {
            if(k < x->ch[]->s+)x=x->ch[];
            else
            {
                k -= x->ch[]->s+;
                x = x->ch[];
            }
            x->pushdown();
        }
        splay(x,goal);
    }
    Node* newnode(Node* fa,int v)
    {
        Node *x=&NODE[++top];
        x->id=top;
        x->ch[]=x->ch[]=null;
        x->s=;
        x->v=x->sum=v;
        x->add=;
        x->fa=fa;
        return x;
    }
    void build(Node* &x,int l,int r,Node* fa)
    {
        if(l>r)return ;
        int m=(l+r)>>;
        x=newnode(fa,num[m]);
        build(x->ch[],l,m-,x);
        build(x->ch[],m+,r,x);
        x->pushup();
    }
    void debug(Node* x)
    {
        if(x!=null)
        {
            debug(x->ch[]);
            cout<<x->v<<" "<<x->sum<<endl;
            debug(x->ch[]);
        }
    }
    void init(int n)
    {
        top=;
        null->id=;
        null->fa = null->ch[] = null->ch[] = NULL;
        null->s = null->add = null->v = null->sum = ;
        root = newnode(null,-);
        root->ch[] = newnode(root,-);
        root->s=;
        for(int i=;i<=n;i++)scanf("%d",&num[i]);
        build(root->ch[]->ch[],,n,root->ch[]);
        root->ch[]->pushup();root->pushup();
    }
    void update()
    {
        int l,r,c;
        scanf("%d%d%d",&l,&r,&c);
        RTO(l,null);
        RTO(r+,root);
        root->ch[]->ch[]->add += c;
        root->ch[]->ch[]->v += c;
        root->ch[]->ch[]->sum += (ll)c*root->ch[]->ch[]->s;
    }
    void query()
    {
        int l,r;
        scanf("%d%d",&l,&r);
        RTO(l,null);
        RTO(r+,root);
        printf("%lld\n",root->ch[]->ch[]->sum);
    }
}spt;
int main()
{
    int n,q;
    scanf("%d%d",&n,&q);
    spt.init(n);
    while(q--)
    {
        char s[];
        scanf("%s",s);
        if(s[]=='Q')spt.query();
        else spt.update();
    }
    return ;
}
/************
10 5
1 5 64 8 2 47 6 4 6 7
************/