poj (2528) Mayor's posters (简单离散化线段树)

poj (2528) Mayor’s posters (简单离散化线段树)
链接：http://poj.org/problem?id=2528
题意：有很多海报要贴在一面墙上，可以覆盖；
海报的宽度<10000000;
很显然这个题是离散化处理的线段树；有一个问题需要注意，离散化的连续问题；那可以在处理离散的时候对l,r,同时加一或者减去一（但要保证l,r的非负性）；

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
using namespace std;
const int maxn = 4e4 + 99;
struct WALL {
    int l, r, lazy;
}tr[maxn*4],que[maxn];
int arr[maxn*6], vis[maxn];
void build(int l, int r, int pos)
{
    tr[pos].l = l; tr[pos].r = r;
    tr[pos].lazy = 0;
    if (l == r)return;
    int mid = l + r >> 1;
    build(l, mid, pos <<1);
    build(mid + 1, r, pos << 1 | 1);
}
void push_down(int pos)
{
    if (tr[pos].lazy == 0)return;
    tr[pos << 1].lazy = tr[pos].lazy;
    tr[pos << 1 | 1].lazy = tr[pos].lazy;
    tr[pos].lazy = 0;
}
void update(int ll, int rr, int pos,int wh)
{
    if (tr[pos].l == ll&&tr[pos].r == rr)
    {
        tr[pos].lazy = wh;
        return;
    }
    push_down(pos);
    int mid = tr[pos].l + tr[pos].r >> 1;
    if (mid >= rr)update(ll, rr, pos << 1, wh);
    else if (mid < ll)update(ll, rr, pos << 1 | 1, wh);
    else
    {
        update(ll, mid, pos << 1, wh);
        update(mid + 1, rr, pos << 1 | 1, wh);
    }
}
void push_ans(int l,int r,int pos)
{
    if (l == r)
    {
        arr[l] = tr[pos].lazy;
        return;
    }
    push_down(pos);
    int mid = l + r >> 1;
    push_ans(l, mid, pos << 1);
    push_ans(mid + 1, r, pos << 1 | 1);
}
int main()
{
    int ca;
    scanf("%d", &ca);
    while (ca--)
    {
        int n,k = 1;
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i)
        {
            int x, y;
            scanf("%d%d", &x, &y);
            x += 2; y += 2;
            arr[k++] = x;     arr[k++] = y;
            arr[k++] = x + 1; arr[k++] = x - 1;
            arr[k++] = y + 1; arr[k++] = y - 1;
            que[i].l = x; que[i].r = y;
            que[i].lazy = i;
        }
        sort(arr + 1, arr + k);
        int len = unique(arr + 1, arr + k) - arr - 1;//去重
        build(1, len, 1);
        for (int i = 1; i <= n; ++i)
        {
            int x = lower_bound(arr + 1, arr + len + 1, que[i].l)-arr;//寻找第i次的海报所对应的位置；
            int y = lower_bound(arr + 1, arr + len + 1, que[i].r)-arr;
            update(x,y, 1, que[i].lazy);
        }
        memset(arr, 0, sizeof arr);
        memset(vis, 0, sizeof vis);
        push_ans(1, len, 1);//对tr上的所有标记，push到根节点；
        int ans = 0;
        for(int i = 1;i<=len;++i)
            if (arr[i]!=0&&!vis[arr[i]])
            {
                ans++;
                vis[arr[i]] = 1;
            }
        printf("%d\n",ans);
    }
    return 0;
}