【Splay】POJ 3468 A Simple Problem with Integers

线段树的题，拿来学习Splay

/*happywu
 * 2014.8.15
 * poj 3468
 * Splay
 */
#include<cstdio>
#include<iostream>
using namespace std;
typedef long long LL;
const int maxn=100000+10;
struct Node
{
	int key,Size,num,fa,son[2];
	LL sum,lazy;
}Tree[maxn];

int n,m,l,r,x,A[maxn],root;

inline int read(){
	static int r, sign;
	static char c;
	r = 0, sign = 1;
	do c = getchar(); while(c != '-' && (c < '0' || c > '9'));
	if( c == '-')sign = -1, c = getchar();
	while( c >= '0' && c <='9') r = r*10 +(int)(c - '0'), c = getchar();
	return sign * r;
}

inline void Update(int x)
{
        Tree[x].Size=Tree[Tree[x].son[0]].Size+Tree[Tree[x].son[1]].Size+Tree[x].num;
	Tree[x].sum=(LL)Tree[x].key+(LL)Tree[Tree[x].son[0]].sum+(LL)Tree[Tree[x].son[1]].sum;
}

inline void Push_Down(int x)
{
	if(Tree[x].lazy==0)return;
	Tree[x].key+=Tree[x].lazy;
	Tree[Tree[x].son[0]].lazy+=Tree[x].lazy;
	Tree[Tree[x].son[1]].lazy+=Tree[x].lazy;
	Tree[Tree[x].son[0]].sum+=(LL)Tree[Tree[x].son[0]].Size*Tree[x].lazy;
	Tree[Tree[x].son[1]].sum+=(LL)Tree[Tree[x].son[1]].Size*Tree[x].lazy;
	Tree[x].lazy=0;
}

inline void Rotate(int x,int c)
{
	int y=Tree[x].fa;
	Push_Down(y);Push_Down(x);
	Tree[y].son[!c]=Tree[x].son[c];
	if(Tree[x].son[c])Tree[Tree[x].son[c]].fa=y;
	Tree[x].fa=Tree[y].fa;
	if(Tree[y].fa)Tree[Tree[y].fa].son[Tree[Tree[y].fa].son[1]==y]=x;
	Tree[y].fa=x;Tree[x].son[c]=y;
	Update(y),Update(x);
	if(Tree[x].fa==0)root=x;
}

inline void NewNode(int &r,int val,int f)
{
	Tree[r].fa=f;
	Tree[r].sum=Tree[r].key=val;
	Tree[r].Size=Tree[r].num=1;
	Tree[r].lazy=0;
}

inline void buildtree(int &x,int l,int r,int f)
{
	if(l>r)return;
	int mid=(l+r)>>1;
	x=mid;
	NewNode(x,A[mid],f);
	if(l<mid)buildtree(Tree[x].son[0],l,mid-1,x);
	if(mid<r)buildtree(Tree[x].son[1],mid+1,r,x);
	Update(x);
}

inline void Splay(int x,int f)
{
	Push_Down(x);
	while(Tree[x].fa!=f)
	{
		if(Tree[Tree[x].fa].fa==f)
			Rotate(x,Tree[Tree[x].fa].son[0]==x);
		else
		{
			int y=Tree[x].fa;
			int kind=Tree[Tree[y].fa].son[1]==y;
			if(Tree[y].son[kind]==x)
				Rotate(y,!kind) , Rotate(x,!kind);
			else
				Rotate(x,kind)  , Rotate(x,!kind);
		}
	}
	Update(x);
}
inline void Add(int l,int r,int x)
{
	Splay(l-1,0);
	Splay(r+1,root);
	Tree[Tree[r+1].son[0]].lazy+=x;
	Tree[Tree[r+1].son[0]].sum+=Tree[Tree[r+1].son[0]].Size*x;
	Push_Down(Tree[r+1].son[0]);
	Update(r+1);
	Update(root);
}

inline LL Query(int l,int r)
{
	Splay(l-1,0);
	Splay(r+1,root);
	Update(r+1);
	return Tree[Tree[r+1].son[0]].sum;
}

inline void Travel(int x)
{
    Push_Down(x);
    if(Tree[x].son[0])Travel(Tree[x].son[0]);
    printf("%d ",Tree[x].key);
    if(Tree[x].son[1])Travel(Tree[x].son[1]);
}

int main()
{
	n=read(),m=read();
	A[1]=0;
	for(int i=1;i<=n;i++)
		A[i+1]=read();
	A[n+2]=0;
	buildtree(root,1,n+2,0);
	char com=0;
	for(int i=1;i<=m;i++)
	{
		while(com!='C'&&com!='Q')com=getchar();
		if(com=='C')
		{
			l=read(),r=read(),x=read();
			Add(l+1,r+1,x);
		}
		else
		{
			l=read(),r=read();
			printf("%lld\n",Query(l+1,r+1));
		}
		com=0;
	}
	return 0;
}