cdq分治三位偏序陌上花开

三位偏序裸题

// let't bring the sky
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>

using namespace std;
const int maxn = 1e5 + 10;
struct node
{
    int a, b, c, sz, ans;
};
int n, k;
node a[maxn];
int ans[maxn];
int tree[maxn];
bool cmp1(node a, node b)
{
    if(a.a != b.a)
    return a.a < b.a;
    if(a.b != b.b)
        return a.b < b.b;
    return a.c < b.c;
}

bool cmp2(node a, node b)
{
    if(a.b != b.b)
        return a.b < b.b;
    return a.c < b.c;
}

int lowbit(int x)
{
    return x&(-x);
}
void add(int pos, int val)
{
    while(pos <= k)
    {
        tree[pos] += val;
        pos += lowbit(pos);
    }
}

int ask(int pos)
{
    int ans = 0;
    while(pos > 0)
    {
        ans += tree[pos];
        pos -= lowbit(pos);
    }
    return ans;
}
void cdq(int l, int r)
{
     if(l == r) return;
     int mid = (l + r)>>1;
     cdq(l, mid), cdq(mid + 1, r);//向下分治
    sort(a + l, a + mid + 1, cmp2);
     sort(a + mid + 1, a + r + 1, cmp2);
     int i = mid + 1, j = l;
     //归并计算左边对右边的贡献值，因为开始已经是对a排序的，所以
     //归并的左半和右半边都是a有序的，将左边b比右边b小的放进树
     //查询右边c比左边c大的，这时候也是右边b比左边b大的，就是结果
     for(; i <= r; i++)
     {
         while(a[i].b >= a[j].b && j <= mid)
            add(a[j].c, a[j].sz), j++;
         a[i].ans += ask(a[i].c);
     }
     for(int i = l; i < j; i++)
        add(a[i].c, -a[i].sz);
}

int main()
{
    scanf("%d%d", &n, &k);
    memset(a, 0, sizeof(a));
    for(int i = 1; i <= n; i++)
    {
        scanf("%d%d%d", &a[i].a, &a[i].b, &a[i].c);
    }
    sort(a + 1, a + 1 + n, cmp1);
    int c = 0;
    int cnt = 0;
    //下面统计重复元素去重
    for(int i = 1; i <= n; i++)
    {
        c++;
        if(a[i].a != a[i + 1].a || a[i].b != a[i + 1].b || a[i].c != a[i + 1].c)
        {
             a[++cnt] = a[i];
             a[cnt].sz = c;
             c = 0;
        }
    }
    cdq(1, cnt);
    for(int i = 1; i <= cnt; i++)
    {
        ans[a[i].sz - 1 + a[i].ans] += a[i].sz;
    }
    for(int i = 0 ; i < n; i++)
    {
            printf("%d\n", ans[i]);
    }
    return 0;
}