题目大意:市长竞选,在一个墙上贴海报,每个海报都有起点和终点,问最后有几张海报是可见的。
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
struct node
{
int x;
int num;
}s[20004];//用于离散化,存储一个端点
struct tree
{
int l, r;
int color;
}p[100004];//树的存储结构
int n, sum;
int m[10003][2];
int f[20004];
int cmp(const void* a, const void* b)
{
return (*(struct node*)a).num - (*(struct node*)b).num;
}
void build(int t, int lc, int rc)
{
//当前节点
p[t].l = lc;
p[t].r = rc;
p[t].color = 0;
if(lc == rc) return ;
//如果还有子树,分治之
build(2*t, lc, (lc + rc)/2);
build(2*t + 1, (lc + rc)/2 + 1, rc);
}
void insert(int t, int lc, int rc, int col)
{
if(p[t].l == lc && p[t].r == rc)//找到了目标线段
{
p[t].color = col;
return ;
}
if(p[t].color > 0 && p[t].color != col)//目标线段与当前线段有交集,将颜色传递到下层节点
{
p[2*t].color = p[2*t + 1].color = p[t].color;
p[t].color = 0;//当前节点颜色置空
}
int mid = (p[t].l + p[t].r)/2;
if(rc <= mid)//左子树
insert(2*t, lc, rc, col);
else if(lc > mid)//右子树
insert(2*t + 1, lc, rc, col);
else//左右子树
{
insert(2*t, lc, mid, col);
insert(2*t + 1, mid + 1, rc, col);
}
}
void search(int t)
{
//当前节点
if(p[t].color != 0)
{
if(!f[p[t].color])
{
f[p[t].color] = 1;
++sum;
}
return ;
}
//分治
search(2*t);
search(2*t + 1);
}
int main()
{
int cas, i;
scanf("%d", &cas);
while(cas--)
{
scanf("%d", &n);
for(i = 0; i < n; ++i)
{
scanf("%d %d", &m[i][0], &m[i][1]);
s[2*i].x = -(i+1);
s[2*i].num = m[i][0];
s[2*i + 1].x = i+1;
s[2*i + 1].num = m[i][1];
}
//离散化的过程
qsort(s, 2*n, sizeof(s[0]), cmp);
int ss = 1;
int temp = s[0].num;
for(i = 0; i < 2*n; ++i)
{
if(s[i].num != temp)
{
++ss;
temp = s[i].num;
}
if(s[i].x < 0)
m[-s[i].x - 1][0] = ss;
else
m[s[i].x - 1][1] = ss;
}
//离散化完成
build(1, 1, ss);
for(i = 0; i < n; ++i)
insert(1, m[i][0], m[i][1], i+1);
memset(f, 0, sizeof(f));
sum = 0;
search(1);
printf("%d\n", sum);
}
return 0;
}