线段树

POJ 2528

我的第一道线段树，求的是区间最终被多少种颜色覆盖的变形。

由于各种不慎，种种wa，导致郁闷了一个晚上。

主要是处理原数据和离散后的数据时，要小心维护。

另外也是首次使用数组实现树，对数组长度把握不好。

离散化数据后要舍去重复。

Mayor's posters

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 19093		Accepted: 5382

Description

The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wall for placing the posters and introduce the following rules:

• Every candidate can place exactly one poster on the wall.
• All posters are of the same height equal to the height of the wall; the width of a poster can be any integer number of bytes (byte is the unit of length in Bytetown).
• The wall is divided into segments and the width of each segment is one byte.
• Each poster must completely cover a contiguous number of wall segments.

They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.

Input

The first line of input contains a number c giving the number of cases that follow. The first line of data for a single case contains number 1 <= n <= 10000. The subsequent n lines describe the posters in the order in which they were placed. The i-th line among the n lines contains two integer numbers l_i and ri which are the number of the wall segment occupied by the left end and the right end of the i-th poster, respectively. We know that for each 1 <= i <= n, 1 <= l_i <= ri <= 10000000. After the i-th poster is placed, it entirely covers all wall segments numbered l_i, l_i+1 ,... , ri.

Output

For each input data set print the number of visible posters after all the posters are placed.

Sample Input

1
5
1 4
2 6
8 10
3 4
7 10

Sample Output

4

#include<cstdio>
#include<cstring>
#include<cstdlib>
int c,n,m,cur,cnt,min,max;
int v[100000],a[100000],p[100000],l[100000],r[100000],color[100000];
int cmp(const void* a,const void* b){ return *(int*)a-*(int*)b; }
void build(int t1,int t2,int idx)//构建线段树
{
	l[idx]=t1;r[idx]=t2;
	if(t1==t2)return;
	int mid=t1+(t2-t1)/2;
	build(t1,mid,idx*2);
	build(mid+1,t2,idx*2+1);
}
void paint(int idx)//给区间上色（贴海报）
{
	int u=l[idx],v=r[idx],mid=u+(v-u)/2;
	if(u==v)color[idx]=cur;
	else if(a[u]>=min&&a[v]<=max)color[idx]=cur;
	else{
		if(color[idx]){
			//这里要小心维护，若覆盖子区间，则必须先记录原来海报
			color[idx*2]=color[idx];
			color[idx*2+1]=color[idx];
			color[idx]=0;
		}
		if(min<=a[mid])paint(idx*2);
		if(max>a[mid])paint(idx*2+1);
	}
}
void count(int idx)//数覆盖的区间海报
{
	int temp=color[idx];
	if(l[idx]==r[idx]||temp!=0){
		if(!v[temp]){ v[temp]=1;cnt++; }
	}
	else{
		count(idx*2);
		count(idx*2+1);
	}
}
int main()
{
	scanf("%d",&c);
	while(c--){
		memset(color,0,sizeof(color));
		memset(v,0,sizeof(v));v[0]=1;
		scanf("%d",&n);
		for(int i=1;i<=n;i++){
			scanf("%d %d",&p[i],&p[i+n]);
			a[i]=p[i];a[i+n]=p[i+n];
		}
		//数据离散化后去重
		qsort(&a[1],2*n,sizeof(int),cmp);
		int temp=a[1];m=1;
		for(int i=2;i<=2*n;i++)if(a[i]!=temp){
			temp=a[i];
			a[++m]=temp;
		}
		build(1,m,1);
		for(cur=1;cur<=n;cur++){
			min=p[cur];
			max=p[cur+n];
			paint(1);
		}
		cnt=0;
		count(1);
		printf("%d/n",cnt);
	}
	return 0;
}