南昌网络赛 I. Yukino With Subinterval(一个区间分成几个极大连续区间 cdq分治)

题目

题意： 连续区间就是一段区间的数都相同 比如3 3 4 3 4 4 这是分成了4个极大连续区间。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define m(a,b) memset(a,b,sizeof a)
#define low(i) ((i)&(-i))
#define fnq freopen("input.txt","r",stdin)
using namespace std;
const int N=2e5+5;
struct node{int x,y,val,id;}q[N*5],tmp[N*5];
int c[N],Max=N-5;
void add(int x,int val){
    while(x<=Max) c[x]+=val,x+=low(x);
}
int getsum(int x){
    int res=0;
    while(x) res+=c[x],x-=low(x);
    return res;
}
void _clear(int x){
    while(x<=Max){
        if(!c[x]) break;
        c[x]=0,x+=low(x);
    }
}
int a[N],ans[N];
void cdq(int l,int r){
    if(l==r) return;
    int mid=(l+r)>>1;
    cdq(l,mid),cdq(mid+1,r);
    int i=l,j=mid+1,k=l;
    while(i<=mid&&j<=r){
        if(q[i].x<=q[j].x){
            if(!q[i].id) add(q[i].y,q[i].val);
            tmp[k++]=q[i++];
        }
        else{
            if(q[j].id) ans[q[j].id]+=q[j].val*getsum(q[j].y);
            tmp[k++]=q[j++];
        }
    }
    while(i<=mid){
        if(!q[i].id) add(q[i].y,q[i].val);
        tmp[k++]=q[i++];
    }
    while(j<=r){
        if(q[j].id) ans[q[j].id]+=q[j].val*getsum(q[j].y);
        tmp[k++]=q[j++];
    }
    for(int i=l;i<=r;++i){
        if(!q[i].id) _clear(q[i].y);
        q[i]=tmp[i];
    }
}
int main(){
    //fnq;
    int n,m;scanf("%d%d",&n,&m);
    int tot=0,ovo=0;
    for(int i=1;i<=n;++i){
        scanf("%d",&a[i]);
        if(a[i]!=a[i-1]) q[++tot]=(node){i,a[i],1,0};
    }
    for(int i=1;i<=m;++i){
        int f,pos,d,l,r,x,y;scanf("%d",&f);
        if(f==1){//修改
            scanf("%d%d",&pos,&d);
            if(a[pos]==d) continue;
            if(a[pos]!=a[pos-1])        q[++tot]=(node){pos,a[pos],-1,0};
            if(pos<n&&a[pos+1]!=a[pos]) q[++tot]=(node){pos+1,a[pos+1],-1,0};
            a[pos]=d;
            if(a[pos]!=a[pos-1])        q[++tot]=(node){pos,d,1,0};
            if(pos<n&&a[pos+1]!=a[pos]) q[++tot]=(node){pos+1,a[pos+1],1,0};

        }else{
            scanf("%d%d%d%d",&l,&r,&x,&y);++ovo;//询问区间[l+1,r,x,y]之间的个数 然后再特判a[l]是否在[x,y]之间.
            if(a[l]>=x&&a[l]<=y) ++ans[ovo];
            ++l;
            if(l>r) continue;
            q[++tot]=(node){r,y,1,ovo};
            q[++tot]=(node){l-1,y,-1,ovo};
            if(x>1) q[++tot]=(node){r,x-1,-1,ovo};
            if(x>1) q[++tot]=(node){l-1,x-1,1,ovo};
        }
    }
    cdq(1,tot);
    for(int i=1;i<=ovo;++i) printf("%d\n",ans[i]);
}