Splay的用法

splay区间增减查询

 #include<cstdio>
 #include<algorithm>

 using namespace std;

 const int N = ;
 const int INF = 1e9;
 typedef long long LL;
 int sum[N],data[N],siz[N],tag[N],ch[N][],fa[N],st[N];
 int Root,top;

 inline int read() {
     int x = ,f = ;char ch = getchar();
     for (; ch<''||ch>''; ch = getchar())
         if (ch=='-') f = -;
     for (; ch>=''&&ch<=''; ch = getchar())
         x = x *  + ch - '';
     return x * f;
 }
 inline void pushup(int x) {
     int l = ch[x][],r = ch[x][];
     siz[x] = siz[l] + siz[r] + ;
     sum[x] = sum[l] + sum[r] + data[x];
 }
 inline void pushdown(int x) {
     if (tag[x]) {
         int l = ch[x][],r = ch[x][];
         sum[l] += siz[l] * tag[x];sum[r] += siz[r] * tag[x];
         data[l] += tag[x];data[r] += tag[x];
         tag[l] += tag[x];tag[r] += tag[x];
         tag[x] = ;
     }
 }
 inline int son(int x) {
     return x==ch[fa[x]][];
 }
 inline void rotate(int x) {
     int y = fa[x],z = fa[y],b = son(x),c = son(y),a = ch[x][!b];
     if (z) ch[z][c] = x;else Root = x;fa[x] = z;
     ch[x][!b] = y;fa[y] = x;
     ch[y][b] = a;if (a) fa[a] = y;
     pushup(y),pushup(x);
 }
 inline void splay(int x,int rt) {
     top = ;int p = x;
     while (p) st[++top] = p,p = fa[p];
     while (top) pushdown(st[top]),top--;
     while (fa[x] != rt) {
         int y =fa[x],z = fa[y];
         if (z==rt) rotate(x);
         else {
             if (son(x)==son(y)) rotate(y),rotate(x);
             else rotate(x),rotate(x);
         }
     }
 }
 inline void update(int L,int R,int a) {
     splay(L,);splay(R,L);
     tag[ch[R][]] += a;
     sum[ch[R][]] += siz[ch[R][]] * a;
     data[ch[R][]] += a;
     pushup(R),pushup(L);
 }
 inline int query(int L,int R) {
     splay(L,);splay(R,L);
     return sum[ch[R][]];
 }
 int build(int l,int r) {
     if (l > r) return ;
     if (l==r) {
         siz[l] = ;sum[l] = data[l];return l;
     }
     int mid = (l + r) >> ;
     int t = build(l,mid-);
     fa[t] = mid;ch[mid][] = t;
     t = build(mid+,r);
     fa[t] = mid;ch[mid][] = t;
     pushup(mid);
     return mid;
 }
 int main() {
     int n = read(),m = read();
     for (int i=; i<=n+; ++i) data[i] = read();
     Root = build(,n+);
     fa[] = ;
     //char s[10];
     for (int o,a,b,c,i=; i<=m; ++i) {
         o = read();
         if (o == ) {
             a = read(),b = read(),c = read();
             update(a,b+,c);
         }
         else {
             a = read(),b = read();
             printf("%d\n",query(a,b+));
         }
     }
     return ;
 }