bzoj3262 陌上花开（树状数组套splay/cdq分治）

求三维偏序，可以树套树，第一维排序解决，第二维树状数组，第三维splay
或者cdq分治解决，要注意处理相同权值，细节较多。

树状数组套splay

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,K,ans[N],rt[N<<1],owo=0,fa[N*20],c[N*20][2],sz[N*20],cnt[N*20],v[N*20];
struct data{
    int a,b,c;
}a[N];
inline bool cmp(data a,data b){return a.a==b.a?(a.b==b.b?a.c<b.c:a.b<b.b):a.a<b.a;}
inline void update(int x){
    int l=c[x][0],r=c[x][1];
    sz[x]=sz[l]+sz[r]+cnt[x];
}
inline void rotate(int x,int &k){
    int y=fa[x],z=fa[y],l=x==c[y][1],r=l^1;
    if(y==k) k=x;
    else c[z][y==c[z][1]]=x;
    fa[c[x][r]]=y;fa[y]=x;fa[x]=z;
    c[y][l]=c[x][r];c[x][r]=y;update(y);update(x);
}
inline void splay(int x,int &k){
    while(x!=k){
        int y=fa[x],z=fa[y];
        if(y!=k){
            if(x==c[y][1]^y==c[z][1]) rotate(x,k);
            else rotate(y,k);
        }rotate(x,k);
    }
}
inline void ins(int &p,int Fa,int x,int id){
    if(!p){p=++owo;v[p]=x;cnt[p]=sz[p]=1;fa[p]=Fa;c[p][0]=c[p][1]=0;splay(p,rt[id]);return;}
    if(v[p]==x){cnt[p]++;sz[p]++;splay(p,rt[id]);return;}
    if(x<v[p]) ins(c[p][0],p,x,id);
    else ins(c[p][1],p,x,id);
}
inline int find(int p,int x){//求小于等于x的数有几个
    if(!p) return 0;
    if(v[p]==x) return sz[c[p][0]]+cnt[p];
    if(x<v[p]) return find(c[p][0],x);
    return sz[c[p][0]]+cnt[p]+find(c[p][1],x);
}
inline void add(int x,int val){
    for(;x<=K;x+=x&-x) ins(rt[x],0,val,x);
}
inline int ask(int x,int val){
    int res=0;
    for(;x;x-=x&-x) res+=find(rt[x],val);return res;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();K=read();
    for(int i=1;i<=n;++i) a[i].a=read(),a[i].b=read(),a[i].c=read();
    sort(a+1,a+n+1,cmp);int tmp=0;
    for(int i=1;i<=n;++i){
        if(a[i].a==a[i+1].a&&a[i].b==a[i+1].b&&a[i].c==a[i+1].c) ++tmp;
        else{int res=ask(a[i].b,a[i].c);ans[res]+=tmp+1;tmp=0;}
        add(a[i].b,a[i].c);
    }for(int i=0;i<n;++i) printf("%d\n",ans[i]);
    return 0;
}

cdq分治

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,K,c[N<<1],ans[N],tot=0;
struct data{
    int ans,a,b,c,num;
}a[N],aa[N],tmp[N];
inline bool cmp(data a,data b){return a.a==b.a?(a.b==b.b?a.c<b.c:a.b<b.b):a.a<b.a;}
inline void add(int x,int val){
    for(;x<=K;x+=x&-x) c[x]+=val;
}
inline int ask(int x){
    int res=0;for(;x;x-=x&-x) res+=c[x];return res;
}
inline void cdq(int l,int r){
    if(l==r) return;
    int mid=l+r>>1;cdq(l,mid);cdq(mid+1,r);
    int p1=l,p2=mid+1,owo=l;
    while(p1<=mid&&p2<=r){
        if(a[p1].b<=a[p2].b) add(a[p1].c,a[p1].num),tmp[owo++]=a[p1++];
        else a[p2].ans+=ask(a[p2].c),tmp[owo++]=a[p2++];
    }while(p1<=mid) add(a[p1].c,a[p1].num),tmp[owo++]=a[p1++];
    while(p2<=r) a[p2].ans+=ask(a[p2].c),tmp[owo++]=a[p2++];
    for(int i=l;i<=mid;++i) add(a[i].c,-a[i].num);
    memcpy(a+l,tmp+l,sizeof(a[0])*(r-l+1));
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();K=read();
    for(int i=1;i<=n;++i) aa[i].a=read(),aa[i].b=read(),aa[i].c=read();
    sort(aa+1,aa+n+1,cmp);
    for(int i=1;i<=n;++i){
        if(aa[i].a==aa[i-1].a&&aa[i].b==aa[i-1].b&&aa[i].c==aa[i-1].c) a[tot].num++;
        else a[++tot]=aa[i],a[tot].ans=0,a[tot].num=1;
    }cdq(1,tot);
    for(int i=1;i<=tot;++i) ans[a[i].ans+a[i].num-1]+=a[i].num;
    for(int i=0;i<n;++i) printf("%d\n",ans[i]);
    return 0;
}