POJ 2528 Mayor's posters 线段树的区间覆盖 离散化

//1472K	63MS
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define lch(n) ((n)<<1)
#define rch(n) ((n)<<1|1)

using namespace std;

const int MAX_N = int(1e4);
bool vis[MAX_N+5];
int li[MAX_N+5], ri[MAX_N+5];
int X[MAX_N*3+5];
int tag[MAX_N*16];
int cnt;

inline void push_down(int n){
    if(tag[n] != -1){
        tag[lch(n)] = tag[rch(n)] = tag[n];
        tag[n] = -1;
    }
}

void modify(int a, int b, int v, int n, int l, int r){
    if(a <= l && r <= b){
        tag[n] = v;
        return;
    }
    push_down(n);
    int mid = (l+r)>>1;
    if(mid >= a) modify(a, b, v, lch(n), l, mid);
    if(mid+1 <= b) modify(a, b, v, rch(n), mid+1, r);
}

void query(int n, int l, int r){
    int val = tag[n];
    if(val != -1){
        if(!vis[val]){
            cnt++;
            vis[val] = true;
        }
        return;
    }
    if(l == r) return;
    int mid = (l+r)>>1;
    query(lch(n), l, mid);
    query(rch(n), mid+1, r);
}

int main(){
    int T; scanf("%d", &T);
    while(T--){
        int n, tot = 0;
        scanf("%d", &n);
        for(int i=0; i<n; i++){
            scanf("%d%d", &li[i], &ri[i]);
            X[tot++] = li[i];
            X[tot++] = ri[i];
        }
        sort(X, X+tot);
        int m = 1;
        for(int i=1; i<tot; i++){ //在有序序列中去重
            if(X[i-1] != X[i]) X[m++] = X[i];
        }
        sort(X, X+m);
        memset(tag, -1, sizeof(tag));
        for(int i=0; i<n; i++){
            int a = lower_bound(X, X+m, li[i]) - X;
            int b = lower_bound(X, X+m, ri[i]) - X;
            modify(a, b, i, 1, 0, m-1);
        }
        memset(vis, false, sizeof(vis));
        cnt = 0;
        query(1, 0, m-1);
        printf("%d\n", cnt);
    }
    return 0;
}