hdu5618

题解：

CDQ分治

三重分治

第一重排序

第二重CDQ

第三重树状数组

代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=;
int n,m,c[N],dp[N],T;
struct node
{
    int x,y,z,id;
}a[N],tmp[N];
struct Tree
{
    int c[N];
    inline int low(int x){return x&-x;}
    inline void modify(int x){while (x<=N-)c[x]=,x+=low(x);}
    inline void updata(int x){while (x<=N-)c[x]++,x+=low(x);}
    inline void init(){memset(c,,sizeof c);}
    inline int query(int x)
     {
        int ans=;
        while (x)ans+=c[x],x-=low(x);
        return ans;
     }
}Tree;
inline int cmp(node x,node y)
{
    if (x.x!=y.x)return x.x<y.x;
    if (x.y!=y.y)return x.y<y.y;
    return x.z<y.z;
}
inline int cmp1(node x,node y)
{
    if (x.y!=y.y)return x.y<y.y;
    return x.z<y.z;
}
inline void solve(int l,int r)
{
    if (l==r)return;
    int m=(l+r)>>;
    solve(l,m);
    for (int i=l;i<=r;i++)tmp[i]=a[i];
    sort(tmp+l,tmp+m+,cmp1);
    sort(tmp+m+,tmp+r+,cmp1);
    int pl=l;
    for (int i=m+;i<=r;i++)
     {
         while (pl<=m&&tmp[pl].y<=tmp[i].y)
          {
              Tree.updata(tmp[pl].z);
              pl++;
          }
         dp[tmp[i].id]+=Tree.query(tmp[i].z);
     }
    for (int i=l;i<=m;i++)Tree.modify(tmp[i].z);
    solve(m+,r);
}
inline int read()
{
    int x=;char c;
    for (;c<''||c>'';c=getchar());
    for (;c>=''&&c<='';c=getchar())x=x*+c-;
    return x;
}
inline void write(int x)
{
    if (x>=)write(x/);
    putchar(x%+);
}
int main()
{
    scanf("%d",&T);
    while (T--)
     {
         scanf("%d",&n);
         for (int i=;i<=n;i++)
          {
              a[i].x=read();
              a[i].y=read();
              a[i].z=read();
              a[i].id=i;
          }
         sort(a+,a+n+,cmp);
        memset(dp,,sizeof dp);
        Tree.init();
        solve(,n);
        for (int i=n-;i;i--)
         if (a[i].x==a[i+].x&&a[i].y==a[i+].y&&a[i].z==a[i+].z)
          dp[a[i].id]=dp[a[i+].id];
        for (int i=;i<=n;i++)write(dp[i]),puts("");
     }
}