hdu 5618 Jam's problem again

传送门：
http://acm.hdu.edu.cn/showproblem.php?pid=5618

题意：
三维坐标，对于1个点，找出有多少个点，3个坐标都比该点小！
很神奇的解法，cdq分治，分治的方法是每次都是计算左边对右边贡献的答案为多少。先对第一维x排序，然后把前一半打上标记0，说明他们是x较小的，然后再对y排序，并以此为基准去进行计数，在计数的过程中，对z用树状数组进行维护，即把该z位置打上标记，然后扫到后一半数的时候，就对该z位置进行查询前缀和，看前面有多少3个都比他小的，简直机智的解法啊！！！！
注意需要预处理相等的情况，排个序倒着开个计数器并更新每一个点就ok了！
code：

#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int res[N], t[N];
struct qry {
    int x, y, z, id;
    qry (int x = 0, int y = 0, int z = 0, int id = 0) : x (x), y (y), z (z), id (id) {}
} a[N], b[N];
int f (int x) { return x & -x; }
void add (int x, int c) {
    for (; x < N; x += f (x)) {
        t[x] += c;
    }
}
int query (int x) {
    int r = 0;
    for (; x; x -= f (x)) {
        r += t[x];
    }
    return r;
}
bool cmp (qry a, qry b) {
    if (a.y != b.y) return a.y < b.y;
    return a.id < b.id;
}
void solve (int l, int r) {
    if (l == r) return;
    int m = (l + r) >> 1, bn = 0;
    for (int i = l; i <= m; i++) {
        b[++bn] = qry (0, a[i].y, a[i].z, 0);
    }
    for (int i = m + 1; i <= r; i++) {
        b[++bn] = qry (0, a[i].y, a[i].z, a[i].id);
    }
    sort (b + 1, b + 1 + bn, cmp);
    for (int i = 1; i <= bn; i++)
        if (b[i].id == 0) {
            add (b[i].z, 1);
        } else {
            res[b[i].id] += query (b[i].z);
        }
    for (int i = 1; i <= bn; i++) if (b[i].id == 0) {
        add (b[i].z, -1);
    }
    solve (l, m);
    solve (m + 1, r);
}
bool cmp2 (qry a, qry b) {
    if (a.x != b.x) return a.x < b.x;
    if (a.y != b.y) return a.y < b.y;
    return a.z < b.z;
}
bool cmp3 (qry a, qry b) {
    return a.x == b.x && a.y == b.y && a.z == b.z;
}
int main () {
    int n, T;
    cin >> T;
    while (T--) {
        cin >> n;
        for (int i = 1; i <= n; i++) {
            scanf ("%d%d%d", &a[i].x, &a[i].y, &a[i].z);
            a[i].id = i;
        }
        sort (a + 1, a + 1 + n, cmp2);
        memset (res, 0, sizeof (int) * (n + 5));
        int cnt = 0;
        for (int i = n; i >= 1; i--) {
            if (cmp3 (a[i], a[i + 1])) cnt++;
            else cnt = 0;
            res[a[i].id] += cnt;
        }
        solve (1, n);
        for (int i = 1; i <= n; i++) printf ("%d\n", res[i]);
    }
}