ZOJ1610 Count the Colors

思路：区间更新，另外千万不能拿n建树，不然就会segmentation fault，必须拿8000建树，也就是树是固定的

#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define Max 100010
#define mod 1000000007
using namespace std;
int n, tree[Max << 2], ans[Max], k;
void pushup(int rt) {
    tree[rt] = tree[rt << 1] + tree[rt << 1 | 1];//用不着这个函数，因为是赋值，所以没必要加
}
void pushdown(int rt) {
    if(tree[rt] != -1) {
        tree[rt << 1] = tree[rt << 1 | 1] = tree[rt];//这样也可以替代懒标记，毕竟只是赋值
        tree[rt] = -1;
    }
}
void update(int L, int R, int F, int l, int r, int rt) {
    if(L <= l && r <= R) {
        tree[rt] = F;
        return;
    }
    int m = (l + r) >> 1;
    pushdown(rt);
    if(L <= m)
        update(L, R, F, l, m, rt << 1);
    if(R > m)
        update(L, R, F, m + 1, r, rt << 1 | 1);
}
void query(int l, int r, int rt) {
    if(l == r) {
        if(tree[rt] != k && tree[rt] >= 0) {//在这里来计算。
            ans[tree[rt]]++;
        }
        k = tree[rt];
        return;
    }
    int m = (l + r) >> 1;
    pushdown(rt);
    query(l, m, rt << 1);
    query(m + 1, r, rt << 1 | 1);
}
int main() {
    while(cin >> n) {
        mem(tree, -1), me(ans), k = -1;
        for(int i = 0, f, a, b; i < n; i++) {
            cin >> a >> b >> f;
            update(a + 1, b, f, 1, 8000, 1);
        }
        query(1, 8000, 1);
        for(int i = 0; i <= 8000; i++) {
            if(ans[i])
                printf("%d %d\n", i, ans[i]);
        }
        printf("\n");
    }
    return 0;
}