Tunnel Warfare HDU - 1540 线段树区间合并

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

题意：给你一个长度为n的序列，接下来有m个操作：

D x 表示将单元x毁掉

R  表示修复最后毁坏的那个单元

Q x  询问这个单元以及它周围有多少个连续的单元，如果它本身已经被毁坏了就是0

最初序列全都是完好的（全都是1）

 

思路：这个题可以转化为求该点所在的子序列中最长的连续的1是多少。即转化为区间合并的经典问题，此题重点在查询操作上，需要进行一些剪枝。

int query(int tar,int cur)
{
	if(tree[cur].l==tree[cur].r) return tree[cur].now;
	if(tar<=tree[cur<<1].r)
	{
		if(tar>=tree[cur<<1].r-tree[cur<<1].right+1) return query(tar,cur<<1)+query(tree[cur<<1].r+1,cur<<1|1);
		else return query(tar,cur<<1);
	}
	else
	{
		if(tar<=tree[cur<<1|1].l+tree[cur<<1|1].left-1) return query(tar,cur<<1|1)+query(tree[cur<<1].r,cur<<1);
		else return query(tar,cur<<1|1);
	}
}

我们很快就能想到这么写。但是会T，于是我们想，如果这个区间的最长的连续的1为0，那么就没必要往下找了，因为再往下找也为0.

int query(int tar,int cur)
{
	if(tree[cur].l==tree[cur].r) return tree[cur].now;
	if(tree[cur].now==0) return tree[cur].now;
	if(tar<=tree[cur<<1].r)
	{
		if(tar>=tree[cur<<1].r-tree[cur<<1].right+1) return query(tar,cur<<1)+query(tree[cur<<1].r+1,cur<<1|1);
		else return query(tar,cur<<1);
	}
	else
	{
		if(tar<=tree[cur<<1|1].l+tree[cur<<1|1].left-1) return query(tar,cur<<1|1)+query(tree[cur<<1].r,cur<<1);
		else return query(tar,cur<<1|1);
	}
}

这样还是T。。我们再考虑如果当前区间连续的1等于区间长度，并且该区间包含你要查询的点，那么也没必要往下找了，因为这些都包含。

int query(int tar,int cur)
{
	if(tree[cur].l==tree[cur].r) return tree[cur].now;
	if(tree[cur].now==0) return tree[cur].now;
	if(tree[cur].now==tree[cur].r-tree[cur].l+1) return tree[cur].now;
	if(tar<=tree[cur<<1].r)
	{
		if(tar>=tree[cur<<1].r-tree[cur<<1].right+1) return query(tar,cur<<1)+query(tree[cur<<1].r+1,cur<<1|1);
		else return query(tar,cur<<1);
	}
	else
	{
		if(tar<=tree[cur<<1|1].l+tree[cur<<1|1].left-1) return query(tar,cur<<1|1)+query(tree[cur<<1].r,cur<<1);
		else return query(tar,cur<<1|1);
	}
}

这样就过啦！

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stack>
using namespace std;
const int maxn=50100;
int n,m;
stack<int> st;
struct node{
	int l,r;
	int left,right,now;
}tree[maxn*4];
void pushup(int cur)
{
	tree[cur].left=tree[cur<<1].left;
	if(tree[cur<<1].left==tree[cur<<1].r-tree[cur<<1].l+1) tree[cur].left+=tree[cur<<1|1].left;
	tree[cur].right=tree[cur<<1|1].right;
	if(tree[cur<<1|1].right==tree[cur<<1|1].r-tree[cur<<1|1].l+1) tree[cur].right+=tree[cur<<1].right;
	tree[cur].now=max(max(tree[cur<<1].now,tree[cur<<1|1].now),tree[cur<<1].right+tree[cur<<1|1].left);
}
void build(int l,int r,int cur)
{
	tree[cur].l=l;
	tree[cur].r=r;
	tree[cur].left=tree[cur].right=tree[cur].now=r-l+1;
	if(l==r) return ;
	int m=(l+r)>>1;
	build(l,m,cur<<1);
	build(m+1,r,cur<<1|1);
}
void update(int tar,int val,int cur)
{
	if(tree[cur].l==tree[cur].r)
	{
		tree[cur].left=tree[cur].right=tree[cur].now=val;
		return ;
	}
	if(tar<=tree[cur<<1].r) update(tar,val,cur<<1);
	else update(tar,val,cur<<1|1);
	pushup(cur);
}
int query(int tar,int cur)
{
	if(tree[cur].l==tree[cur].r) return tree[cur].now;
	if(tree[cur].now==0) return tree[cur].now;
	if(tree[cur].now==tree[cur].r-tree[cur].l+1) return tree[cur].now;
	if(tar<=tree[cur<<1].r)
	{
		if(tar>=tree[cur<<1].r-tree[cur<<1].right+1) return query(tar,cur<<1)+query(tree[cur<<1].r+1,cur<<1|1);
		else return query(tar,cur<<1);
	}
	else
	{
		if(tar<=tree[cur<<1|1].l+tree[cur<<1|1].left-1) return query(tar,cur<<1|1)+query(tree[cur<<1].r,cur<<1);
		else return query(tar,cur<<1|1);
	}
}
int main()
{
	char s[5];
	int x;
	while(~scanf("%d%d",&n,&m))
	{
		while(st.size()) st.pop();
		build(1,n,1);
		while(m--)
		{
			scanf("%s",s);
			if(s[0]=='D')
			{
				scanf("%d",&x);
				st.push(x);
				update(x,0,1);
			}
			if(s[0]=='Q')
			{
				scanf("%d",&x);
				int ans=query(x,1);
				printf("%d\n",ans);
			}
			if(s[0]=='R')
			{
				x=st.top();
				st.pop();
				update(x,1,1);
			}
		}
	}

	return 0;
}