HDOJ 1540 Tunnel Warfare （线段树+区间合并）

Tunnel Warfare

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7614    Accepted Submission(s): 2944

Problem Description

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!

 

Input

The 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.

 

Output

Output 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
  
  

 

查询x所在的最长连续为1 的长度，线段树来维护一个区间里面的最长连续长度，在查询的时候，注意左右区间合并中出现的连续长度，如果x在左右区间合并长度里面的话，肯定要比在单独的左右区间里面的长度要长，这样就不要往下一个子树里面查询直接返回就可以了。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stack>
#include<algorithm>
#include<vector>
using namespace std;
#define maxn 500050
struct node
{
    int l;
    int r;
    int lid;
    int rid;
    int lsum;
    int rsum;
    int msum;
}tree[maxn*8];
void pushup(int id)
{
        int tmp=tree[id*2].rsum+tree[id*2+1].lsum;
        if(tmp>tree[id*2].msum&&tmp>tree[id*2+1].msum)
        {
            tree[id].msum=tmp;
            int ll=tree[id*2].r-tree[id*2].l+1;
            int rr=tree[id*2+1].r-tree[id*2+1].l+1;
            if(tree[id*2].lsum==ll)
            {
                tree[id].lsum=tree[id*2].lsum+tree[id*2+1].lsum;
                tree[id].lid=tree[id*2].l;
            }
            else
            {
                 tree[id].lsum=tree[id*2].lsum;
                 tree[id].lid=tree[id*2].r-tree[id*2].rsum+1;
            }

            if(tree[id*2+1].rsum==rr)
            {
                tree[id].rsum=tree[id*2+1].rsum+tree[id*2].rsum;
                tree[id].rid=tree[id*2+1].r;
            }
            else
            {
                tree[id].rsum=tree[id*2+1].rsum;
                tree[id].rid=tree[id*2+1].l+tree[id*2+1].lsum-1;
            }
            return ;
        }
        if(tree[id*2].msum>=tree[id*2+1].msum)
        {
            tree[id].lid=tree[id*2].lid;
            tree[id].rid=tree[id*2].rid;
            tree[id].msum=tree[id*2].msum;

            tree[id].lsum=tree[id*2].lsum;
            tree[id].rsum=tree[id*2+1].rsum;
        }
        else
        {
            tree[id].lid=tree[id*2+1].lid;
            tree[id].rid=tree[id*2+1].rid;
            tree[id].msum=tree[id*2+1].msum;

            tree[id].lsum=tree[id*2].lsum;
            tree[id].rsum=tree[id*2+1].rsum;
        }
}
void build(int id,int tl,int tr)
{
    tree[id].l=tl;
    tree[id].r=tr;
    int mid=(tl+tr)/2;
    if(tl==tr)
    {
        tree[id].lid=tl;
        tree[id].rid=tr;
        tree[id].lsum=1;
        tree[id].rsum=1;
        tree[id].msum=1;
        return ;
    }
    build(id*2,tl,mid);
    build(id*2+1,mid+1,tr);
    pushup(id);
}
int query(int id,int x)
{
    int tl=tree[id].l;
    int tr=tree[id].r;
    int mid=(tl+tr)/2;
    if(x>=tl&&x<=tr)
    {
        if(x>=tree[id].lid&&x<=tree[id].rid)
            return tree[id].msum;
        int tlid=tree[id*2].r-tree[id*2].rsum+1;
        int trid=tree[id*2+1].l+tree[id*2+1].lsum-1;  
        if(x>=tlid&&x<=trid) 
            return trid-tlid+1;    //直接返回
        if(x>=tl&&x<=mid)
            return query(id*2,x);
        else if(x>mid&&x<=tr)
            return query(id*2+1,x);
    }
}
void update(int id,int x,int z)
{
    int tl=tree[id].l;
    int tr=tree[id].r;
    int mid=(tl+tr)/2;
    if(x>tr||x<tl)
        return ;
    if(tl==tr)
    {
        tree[id].msum=z;
        tree[id].rsum=z;
        tree[id].lsum=z;
        tree[id].lid=tree[id].l;
        tree[id].rid=tree[id].r;
        return ;
    }
    if(x>=tl&&x<=mid)
        update(id*2,x,z);
    if(mid<x&&x<=tr)
        update(id*2+1,x,z);
    pushup(id);
}
int n,m;
int main()
{
    char ss[5];
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        stack<int> s;
        build(1,1,n);
        while(m--)
        {
            scanf("%s",ss);
            if(ss[0]=='R')
            {
                if(s.size()==0)
                    continue;
                int id=s.top();
                s.pop();
                update(1,id,1);
            }
            else if(ss[0]=='D')
            {
                int x;
                scanf("%d",&x);
                s.push(x);
                update(1,x,0);
            }
            else
            {
                int x;
                scanf("%d",&x);
                int ans=query(1,x);
                printf("%d\n",ans);
            }
        }
    }
return 0;
}