POJ 2528 Mayor's posters（离散化加线段树成段更新）

Mayor's posters

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 50219		Accepted: 14576

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. 

The picture below illustrates the case of the sample input. 

Sample Input

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

Sample Output

4

题解：线段树的应用，考虑到坐标的范围很大，而实际所用的的点只有不超过20000个，可以将坐标离散化后维护线段树来解

   坐标离散化，将我们的需要的坐标存下来并一一对应0~n，离散化的方法也很容易

1.将所有出现的坐标存到一个数组里，用vector还是比较方便的

2.将数组排序后去重，去重可以用unique()函数，还是很好用的，unique函数是把重复放入元素移到数组末端

附上AC代码：

/*
author: tpbluesky
time:   14/08/15 13:47
题解:	离散化加线段树成段更新 
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <sstream>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define sqr(x) ((x)*(x))
using namespace std;
typedef long long ll;
const int maxn = 200100;

int tree[maxn<<2], col[maxn<<2];
int a[maxn], b[maxn];
vector<int> ve;

void pushdown(int rt)
{
	if(col[rt])
	{
		col[rt<<1] = col[rt<<1|1] = col[rt];
		tree[rt<<1] = tree[rt<<1|1] = col[rt];
		col[rt] = 0; 
	}
}

void update(int le,int ri,int rt,int x,int y,int val)
{
	if(x <= le &&  y >= ri)
	{
		col[rt] = val;
		tree[rt] = val;
		return;
	}
	pushdown(rt);
	int mid = (le+ri)>>1;
	if(x <= mid)
		update(le,mid,rt<<1, x, y,val);
	if(y > mid)
		update(mid+1,ri,rt<<1|1,x,y,val);
}

int query(int le,int ri,int rt,int x)
{
	if(le  == ri)
		return tree[rt];
	pushdown(rt);
	int mid = (le+ri)>>1;
	if(x <= mid)
		return query(le,mid,rt<<1,x);
	else
		return query(mid+1,ri,rt<<1|1,x);
}
vector<int> ans;
int main()
{
	int T, n;
	cin>>T;
	while(T--)
	{
		ve.clear();
		ans.clear();
		scanf("%d",&n);
		for(int i = 0;i < n;++i)
		{
			scanf("%d%d",&a[i],&b[i]);
			ve.push_back(a[i]);
			ve.push_back(b[i]);
		}
		sort(ve.begin(),ve.end());
		ve.erase(unique(ve.begin(),ve.end()),ve.end());		//离散化过程 
		int h = ve.size();
		memset(tree,0,sizeof(tree));
		memset(col,0,sizeof(col));
		for(int i = 0;i < n;++i)
		{
			int x = lower_bound(ve.begin(),ve.end(),a[i])-ve.begin();
			int y = lower_bound(ve.begin(),ve.end(),b[i])-ve.begin();
			update(0,h-1,1,x,y,i+1);
		}
		for(int i = 0;i < h;++i)
			ans.push_back(query(0,h-1,1,i));
		sort(ans.begin(),ans.end());
		ans.erase(unique(ans.begin(),ans.end()),ans.end());
		printf("%d\n",ans.size());
	}
    return 0;
}