COGS 2479. [HZOI 2016]偏序 双重CDQ分治+树状数组

题目链接点这里

博客推荐这篇：COGS 2479. [HZOI 2016]偏序 [CDQ分治套CDQ分治 四维偏序]

看完秒懂

#include
#include
#include
#include
#include
#include
using namespace std;
#define mem(x,y) memset(x,y,sizeof(x))
#define FIN freopen("input.txt","r",stdin)
#define fuck(x) cout< PLL;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int n;
LL ans;
struct Nod
{
    int a,b,c;
    bool flag;
} arr[MX+5],tmp[MX+5],tmp1[MX+5];
LL tree[MX+5];
int lowbit(int x)
{
    return x&-x;
}
void tree_add(int x,int d)
{
    while(x<=n)
    {
        tree[x]+=d;
        x+=lowbit(x);
    }
}
LL tree_sum(int x)
{
    //cout<>1;
    CDQ2(l,m);
    CDQ2(m+1,r);
    int p=l,q=m+1,w=l;
    while(p<=m||q<=r)
    {
        if(q>r||(p<=m&&tmp[p].b>1;
    CDQ1(l,m);
    CDQ1(m+1,r);
    int p=l,q=m+1,w=l;
    while(p<=m||q<=r)
    {
        if(q>r||(p<=m&&arr[p].a>n;
    for(int i=0; i