http://acm.hdu.edu.cn/showproblem.php?pid=1166&&线段树区间求和

这两天写几道线段树题，意外发现建树的过程其实就是先序的过程，如果写的是动态的话，删除结点的过程就是后序的过程。。

#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#define L(x)(x<<1)
#define R(x) (x<<1|1)
#define M(x,y) ((x+y)>>1)
#define N 50005
using namespace std;
typedef struct str
{
	int l;
	int r;
	int  key;
}Node;
Node node[N*4];
int value[N];
void build(int t,int l,int r)
{
	node[t].l=l;
	node[t].r=r;
	if(l==r-1)
	{
	  node[t].key=value[r];
	  return ;
	}
	int mid=M(l,r);
	build(L(t),l,mid);
	build(R(t),mid,r);
	node[t].key=node[L(t)].key+node[R(t)].key;
}
void update(int t,int a,int b)
{
	if(node[t].l==node[t].r-1)
	{
		node[t].key+=b;
		return;
	}
	int mid=M(node[t].l,node[t].r);
	if(a>=mid) update(R(t),a,b);
	else  update(L(t),a,b);
	node[t].key+=b;
}
int Quary(int t,int a,int b)
{
	if(node[t].l==a&&node[t].r==b)
	{
		return node[t].key;
	}
	int mid=M(node[t].l,node[t].r);
	if(a>=mid) return Quary(R(t),a,b);
	else
	{
		if(b<=mid) return Quary(L(t),a,b);
		else
		{
			return Quary(L(t),a,mid)+Quary(R(t),mid,b);
		}

	}
}
int main()
{
	int T;
	scanf("%d",&T);
	for(int k=1;k<=T;++k)
	{
		printf("Case %d:\n",k);
		int n;
	     scanf("%d",&n);
		for(int i=1;i<=n;++i)
			scanf("%d",&value[i]);
		   build(1,0,n);
		  char s[10];
		   getchar();
		   while(scanf("%s",s))
		   {
			  if(s[0]=='E') break;
			  int x,y;
			scanf("%d%d",&x,&y);
			  if(s[0]=='A') update(1,x-1,y);
			  else if(s[0]=='S') update(1,x-1,-y);
			  else if(s[0]=='Q') printf("%d\n",Quary(1,x-1,y));
		   }
	}return 0;
}