hdu1540 区间操作，合并，模板题

During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except the two at the ends, every village was directly connected with two neighboring ones.

Frequently the invaders launched attack on some of the villages and destroyed the parts of tunnels in them. The Eighth Route Army commanders requested the latest connection state of the tunnels and villages. If some villages are severely isolated, restoration of connection must be done immediately!

InputThe first line of the input contains two positive integers n and m (n, m ≤ 50,000) indicating the number of villages and events. Each of the next m lines describes an event.

There are three different events described in different format shown below:

D x: The x-th village was destroyed.

Q x: The Army commands requested the number of villages that x-th village was directly or indirectly connected with including itself.

R: The village destroyed last was rebuilt. 
OutputOutput the answer to each of the Army commanders’ request in order on a separate line. 
Sample Input

7 9
D 3
D 6
D 5
Q 4
Q 5
R
Q 4
R
Q 4

Sample Output

1
0
2
4

题意：D代表破坏村庄，R代表修复最后被破坏的那个村庄，Q代表询问包括x在内的最大连续区间是多少
题解：线段树的合并，这道题就是需要合并，D的话破坏了这个村庄，那怎么办呢，就相当于中间切开，那么就是
相当于把当前这个点标记为0，然后再去更新它的父亲，这样怎么样会更加好做，好理解呢。
一段区间可以成为两段区间拼凑而成。
然后，我们定义老ls，rs表示左边连续区间，右边连续区间，ms表示最大连续区间，然后开始都为
整段，然后以D来切割，每段ls与rs最大值都不能超过当前这个点表示的区间
更新时方法:
左边就位左儿子的左边，右边就位右儿子的右边，然后最大值，就位左边，右边，和左儿子右边和
右儿子左边拼起来，就可以了。
查询操作：就是如果当前点，包涵在左边的右边，则可以和右子树的左儿子合并，同理，右边也一
样，然后最大值就是判断该段是否都联通了，是的话就直接可以推出返回值了，就

 #include<cstdio>
 #include<algorithm>
 #include<iostream>
 #include<cmath>
 #include<cstring>
 using namespace std;
 const int MAXN=;
 char s[];
 int tk[MAXN*]={},x,top,n,m;
 struct fzy{
     int ls,rs,ms,l,r;
 }tree[MAXN*];
 void build(int l,int r,int p){
     tree[p].ls=tree[p].ms=tree[p].rs=r-l+;//一开始标记为所有
     tree[p].l=l;tree[p].r=r;
     if (l!=r)
     {
         int mid=(l+r)>>;
         build(l,mid,p*);
         build(mid+,r,p*+);
     }
 }
 void change(int p,int t,int x)
 {
     if (tree[p].l==tree[p].r)
     {
         if (x==)
         {
             tree[p].ls=tree[p].ms=tree[p].rs=;
         }
         else
         {
             tree[p].ls=tree[p].ms=tree[p].rs=;
         }
         return;
     }
     int mid=(tree[p].l+tree[p].r)>>;
     if (t<=mid) change(*p,t,x);
     else change(*p+,t,x);
     tree[p].ls=tree[p*].ls;
     tree[p].rs=tree[p*+].rs;
     tree[p].ms=max(max(tree[p*].ms,tree[p*+].ms),tree[p*].rs+tree[p*+].ls);
     if (tree[p*].ls==tree[p*].r-tree[p*].l+)
         tree[p].ls+=tree[p*+].ls;
     if (tree[p*+].rs==tree[p*+].r-tree[p*+].l+)
         tree[p].rs+=tree[p*].rs;
 }
 int query(int p,int x)
 {
     if (tree[p].l==tree[p].r||tree[p].ms==||tree[p].ms==tree[p].r-tree[p].l+) return tree[p].ms;
     int mid=(tree[p].l+tree[p].r)>>;
     if (x<=mid)
     {
         if (x>=tree[p*].r-tree[p*].rs+) return query(p*,x)+query(p*+,mid+);//表示还可以和右边连
         else return query(p*,x);
     }
     else
     {
         if (x<=tree[p*+].l+tree[p*+].ls-) return query(p*+,x)+query(p*,mid);//表示还可以和左边连
         else return query(p*+,x);
     }
 }
 int main()
 {
     while (~scanf("%d%d",&n,&m))
     {
         top=;
         build(,n,);
         for (int i=;i<=m;i++)
         {
             scanf("%s",&s);
             if (s[]=='D')
             {
                 scanf("%d",&x);
                 tk[++top]=x;
                 change(,x,);
             }
             else if (s[]=='Q')
                  {
                      scanf("%d",&x);
                       printf("%d\n",query(,x));
                  }
                  else
                  {
                     if (top>)
                     {
                         x=tk[top--];
                         change(,x,);
                     }
                  }
         }
     }
 }

没什么了。