NOI2005 维修数列

这道题是splay基本操作最全面的练习了吧！ 看了 hzwer 大神的代码觉得非常清晰才学会的。代码非常丑。。由于输入数据比较大所以加读入优化会快不少， 然后还要用 ”垃圾回收“：把删除的节点占用的地址 记录下来，插入新节点时先用这些地址  再用sz++开拓出来的新地址。pushdown 是针对所有 lazy tag 的， 可以在 find函数里直接pushdown. update 是通过儿子节点来更新该节点的信息， 针对除lazy tag 外的其他信息。在splay中进行。pushdown 以及 update 的具体顺序要仔细考虑清楚， 否则会出现各种错误

</pre><pre name="code" class="cpp">#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int inf=999999999;
int n,m,root;
int sz,a[600000],id[600000],rec[600000];
char s[20];
struct Node{
	int key,rma,lma,ma,sum,sz;
	bool tag,rev;
	int fa,l,r;
}tree[600000];
inline void pushdown(int x){
	int y=tree[x].l, z=tree[x].r;
	if(tree[x].tag){
		tree[x].tag=tree[x].rev=0;
		if(y){
			tree[y].tag=1;tree[y].key=tree[x].key;
			tree[y].sum=tree[y].sz*tree[y].key;
		}
		if(z){
			tree[z].tag=1;tree[z].key=tree[x].key;
			tree[z].sum=tree[z].sz*tree[z].key;
		}
		if(tree[x].key>0){
			if(y)tree[y].lma=tree[y].rma=tree[y].ma=tree[y].sum;
			if(z)tree[z].lma=tree[z].rma=tree[z].ma=tree[z].sum;
		}
		else{
			if(y)tree[y].lma=tree[y].rma=0, tree[y].ma=tree[y].key;
			if(z)tree[z].lma=tree[z].rma=0, tree[z].ma=tree[z].key;
		}
	}
	else if(tree[x].rev){
		tree[x].rev=0; tree[y].rev^=1; tree[z].rev^=1;
		swap(tree[y].l, tree[y].r); swap(tree[z].l, tree[z].r);
		swap(tree[y].lma,tree[y].rma); swap(tree[z].lma, tree[z].rma);
	}
}
inline int find(int y,int x){
	int ret=root;
	while(1){
		pushdown(ret);
		if(tree[tree[ret].l].sz+1==x)return ret;
		if(tree[tree[ret].l].sz>=x)ret=tree[ret].l;
		else x-=tree[tree[ret].l].sz+1,ret=tree[ret].r; 
	}
}
inline void pushup(int x){
	int y=tree[x].l, z=tree[x].r;
	tree[x].ma=max(tree[y].ma, tree[z].ma);
	tree[x].ma=max(tree[x].ma, tree[y].rma+tree[x].key+tree[z].lma);
	tree[x].lma=max(tree[y].lma, tree[y].sum+tree[x].key+tree[z].lma);
	tree[x].rma=max(tree[z].rma, tree[z].sum+tree[x].key+tree[y].rma);
	tree[x].sum=tree[y].sum+tree[z].sum+tree[x].key;
	tree[x].sz=tree[y].sz+tree[z].sz+1;
}
inline void unit(int x,int to, int k){
	if(x)tree[x].fa=to;
	if(!k)tree[to].l=x;
		else tree[to].r=x;
}
inline void rotate(int x, int k){
	int y=tree[x].fa,z=tree[y].fa;
	if(!k){
		unit(tree[x].l,y,!k);
		unit(x,z,tree[z].r==y);
		unit(y,x,k)	;	
	}
	else{
		unit(tree[x].r,y,!k);
		unit(x,z,tree[z].r==y);
		unit(y,x,k)	;	
	}
	pushup(y);
}
inline void splay(int x,int goal)
{
	if(!goal)root=x;
	while(tree[x].fa!=goal){
		
		int y=tree[x].fa, z=tree[y].fa;
		if(z==goal){rotate(x,tree[y].l==x);break;}
		if( (tree[y].r==x) == (tree[z].r==y) )rotate(y,tree[z].l==y), rotate(x,tree[y].l==x);
		else rotate(x,tree[y].l==x),rotate(x,tree[z].l==x);
	}
	pushup(x);
}
inline void build(int x, int y,int father){
	if(x>y)return;
	int mid=(x+y)>>1, now=id[mid], pre=id[father];
	if(x==y){
		tree[now].lma=tree[now].rma=max(a[mid],0);
		tree[now].ma=tree[now].key=tree[now].sum=a[mid];
		tree[now].sz=1; tree[now].fa=pre;
		if(mid<father)tree[pre].l=now;
			else tree[pre].r=now;
		return;
	}
	build(x,mid-1,mid); build(mid+1,y,mid);
	tree[now].key=a[mid]; tree[now].fa=pre;
	pushup(now);
	if(mid<father)tree[pre].l=now;
		else tree[pre].r=now;
}
inline int read(){
	int tem=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){
		tem*=10; tem+=ch-'0';
		ch=getchar();
	}
	return tem*f;
}
inline void insert(int k, int tot){
	for(int i=1;i<=tot;i++)
	a[i]=read();
	for(int i=1;i<=tot;i++)
	if(rec[0])id[i]=rec[rec[0]--];
	else id[i]=++sz;
	build(1,tot,0);
	int x=find(root,k+1),y=find(root,k+2),z=id[(tot+1)/2];
	splay(x,0);splay(y,root);
	tree[y].l=z; tree[z].fa=y;
	pushup(y); pushup(x);
}
inline void reclaim(int x){
	if(x==0)return;
	rec[++rec[0]]=x;
	reclaim(tree[x].l);
	reclaim(tree[x].r);
	tree[x].key=tree[x].rma=tree[x].lma=tree[x].ma=tree[x].sum=tree[x].sz=0;
	tree[x].tag=tree[x].rev=tree[x].fa=tree[x].l=tree[x].r=0;
}
inline void del(int k, int tot){
	int x=find(root,k), y=find(root,k+tot+1);
	splay(x,0); splay(y,root);
	reclaim(tree[y].l); tree[y].l=0;
	pushup(y); pushup(x);
}

inline void reverse(int k, int tot){
	int x=find(root,k), y=find(root,k+tot+1);
	splay(x,0); splay(y,root);
	int z=tree[y].l;
	if(!tree[x].tag){
		tree[z].rev^=1;
		swap(tree[z].lma, tree[z].rma);
		swap(tree[z].l, tree[z].r);
	}
	pushup(y); pushup(x);
}
inline void getsum(int k ,int tot){
	int x=find(root,k), y=find(root,k+tot+1);
	splay(x,0); splay(y,root);
	int z=tree[y].l;
	printf("%d\n",tree[z].sum);
}
inline void same(int k, int tot, int c){
	int x=find(root,k), y=find(root,k+tot+1);
	splay(x,0); splay(y,root);
	int z=tree[y].l;
	tree[z].tag=1; tree[z].key=c; tree[z].sum=tree[z].sz*c;
	if(c>0)tree[z].lma=tree[z].rma=tree[z].ma=tree[z].sum;
	else tree[z].lma=tree[z].rma=0, tree[z].ma=c;
	pushup(y); pushup(x);
}
int main()
{
	scanf("%d%d",&n,&m);
	a[1]=-inf; a[n+2]=-inf;
	tree[0].ma=-inf;
	for(int i=1;i<=n;i++)
		a[i+1]=read();
	for(int i=1;i<=n+2;i++)
		id[i]=i;
	build(1,n+2,0);
	root=(n+3)/2;  sz=n+2;
	int k,tot,c;
	while(m--){
		scanf("%s",s);
		switch(s[0]){
			case 'I':k=read();tot=read();insert(k,tot);break;
			case 'D':k=read();tot=read();del(k,tot);break;
			case 'R':k=read();tot=read();reverse(k,tot);break;
			case 'G':k=read();tot=read();getsum(k,tot);break;
			case 'M':
				if(s[2]=='K')k=read(),tot=read(),c=read(),same(k,tot,c);
				else printf("%d\n",tree[root].ma);
				break;
		}
	}
    return 0;
}