BZOJ2863&&BZOJ1176 CDQ分治

1176：https://www.lydsy.com/JudgeOnline/problem.php?id=1176

2683：https://www.lydsy.com/JudgeOnline/problem.php?id=2683

一模一样的两道题

算法不是什么二维树状数组

是CDQ分治

什么是CDQ？

OI金牌女选手陈丹琦的首拼

厉害吧

我也是刚刚学会CDQ分治

核心思想是用分治的离线算法

把二维才能解决的问题

转化到一维来解决

网上实在找不到什么好点的入门教程

我是硬看论文和别人代码才看懂得

论文：https://wenku.baidu.com/view/52f9c11cff00bed5b9f31d2d.html

1176 AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxn 800005
int s,w,n,cnt;
int ans[maxn],sum[2000005];
struct data{int x,y,z,pos,id;}a[maxn],b[maxn];

inline void read(int &x){char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok) x=-x;}

inline bool cmp(data a,data b){
    if (a.x==b.x&&a.y==b.y) return a.pos<b.pos;
    else if (a.x==b.x) return a.y<b.y;
    else return a.x<b.x;
}
inline void add(int x,int v){
    for(int i=x;i<=w;i+=i&(-i)) sum[i]+=v;
}
inline int query(int x){
    int ret=0;
    for(int i=x;i;i-=i&(-i)) ret+=sum[i];
    return ret;
}
inline void solve(int l,int r){
    if (l==r) return;
    int mid=(l+r)/2,l1=l,l2=mid+1; 
    for(int i=l;i<=r;++i){
        if (a[i].id<=mid&&!a[i].pos) add(a[i].y,a[i].z);
        if (a[i].id>mid&&a[i].pos) ans[a[i].pos]+=query(a[i].y)*a[i].z;
    }
    for(int i=l;i<=r;++i) if (a[i].id<=mid&&!a[i].pos) add(a[i].y,-a[i].z);
    for(int i=l;i<=r;++i){
        if (a[i].id<=mid) b[l1++]=a[i];
        else b[l2++]=a[i];
    }
    for(int i=l;i<=r;++i) a[i]=b[i];
    solve(l,mid);solve(mid+1,r);
}
int main(){
    read(w);
    while(1){
        int opt;read(opt);
        if (opt==1){
            int x,y,z;read(x),read(y),read(z);
            n++;a[n]=(data){x,y,z,0,n};
        }
        else if (opt==2){
            int x1,x2,y1,y2;read(x1),read(y1),read(x2),read(y2);--x1,--y1;
            ans[++cnt]=(x2-x1)*(y2-y1)*s;
            n++;a[n]=(data){x1,y1,1,cnt,n};
            n++;a[n]=(data){x1,y2,-1,cnt,n};
            n++;a[n]=(data){x2,y1,-1,cnt,n};
            n++;a[n]=(data){x2,y2,1,cnt,n};
        }
        else break;
    }
    sort(a+1,a+n+1,cmp);
    solve(1,n);
    for(int i=1;i<=cnt;i++) printf("%d\n",ans[i]);
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxn 200005
int s,w,n,cnt;
int ans[10005],sum[2000005];
struct data{int x,y,z,pos,id;}a[maxn],b[maxn];

inline void read(int &x){char ch;bool ok;
for(ok=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') ok=1;
for(x=0;isdigit(ch);x=x*10+ch-'0',ch=getchar());if(ok) x=-x;}

inline bool cmp(data a,data b){
    if (a.x==b.x&&a.y==b.y) return a.pos<b.pos;
    else if (a.x==b.x) return a.y<b.y;
    else return a.x<b.x;
}
inline void add(int x,int v){
    for(int i=x;i<=w;i+=i&(-i)) sum[i]+=v;
}
inline int query(int x){
    int ret=0;
    for(int i=x;i;i-=i&(-i)) ret+=sum[i];
    return ret;
}
inline void solve(int l,int r){
    if (l==r) return;
    int mid=(l+r)/2,l1=l,l2=mid+1; 
    for(int i=l;i<=r;++i){
        if (a[i].id<=mid&&!a[i].pos) add(a[i].y,a[i].z);
        if (a[i].id>mid&&a[i].pos) ans[a[i].pos]+=query(a[i].y)*a[i].z;
    }
    for(int i=l;i<=r;++i) if (a[i].id<=mid&&!a[i].pos) add(a[i].y,-a[i].z);
    for(int i=l;i<=r;++i){
        if (a[i].id<=mid) b[l1++]=a[i];
        else b[l2++]=a[i];
    }
    for(int i=l;i<=r;++i) a[i]=b[i];
    solve(l,mid);solve(mid+1,r);
}
int main(){
    read(s);read(w);
    while(1){
        int opt;read(opt);
        if (opt==1){
            int x,y,z;read(x),read(y),read(z);
            n++;a[n]=(data){x,y,z,0,n};
        }
        else if (opt==2){
            int x1,x2,y1,y2;read(x1),read(y1),read(x2),read(y2);--x1,--y1;
            ans[++cnt]=(x2-x1)*(y2-y1)*s;
            n++;a[n]=(data){x1,y1,1,cnt,n};
            n++;a[n]=(data){x1,y2,-1,cnt,n};
            n++;a[n]=(data){x2,y1,-1,cnt,n};
            n++;a[n]=(data){x2,y2,1,cnt,n};
        }
        else break;
    }
    sort(a+1,a+n+1,cmp);
    solve(1,n);
    for(int i=1;i<=cnt;i++) printf("%d\n",ans[i]);
}

2683 AC代码：