整体二分模板(带修)

P2617

#include
#include
#include
#include
using namespace std;
const int MAXN=1e5+5;
int n,m,Ans[MAXN<<2],cg[MAXN<<2],tot,va[MAXN<<2],b[MAXN<<2],c1;
struct SG{
	int l,r,sum;
}t[MAXN<<2];
struct que{
	int id,l,r,k,t,v;
	que(){};
	que(int I,int L,int R,int K,int T,int V){id=I,l=L,r=R,k=K,t=T,v=V;
	}
};
vectorq;
bool cmp(que x,que y){return x.t>1;
	bui(p<<1,l,mid);bui(p<<1|1,mid+1,r);
}
void upd(int p,int x,int k){
	if(t[p].l==t[p].r){t[p].sum+=k;return;}
	int mid=(t[p].l+t[p].r)>>1;
	if(x<=mid) upd(p<<1,x,k);
	else upd(p<<1|1,x,k);
	UPD(p);
}
int ask(int p,int L,int R){
	if(t[p].l>=L&&t[p].r<=R) return t[p].sum;
	int mid=(t[p].l+t[p].r)>>1,res=0;
	if(L<=mid) res+=ask(p<<1,L,R); 
	if(R>mid) res+=ask(p<<1|1,L,R);
	return res;
}
void solve(int L,int R,vectorv){
//	printf("L,R:%d %d\n",L,R);
	if(L==R){
		for(unsigned int i=0;i>1;
	vectorv1,v2;vectortmp;
	for(unsigned int i=0;i>c;
		if(c[0]=='C'){
			int x,y;scanf("%d%d",&x,&y);
			q.push_back((que){0,x,va[x],0,++oo,-1});
			va[x]=y;b[++pp]=y;
			q.push_back((que){0,x,y,0,++oo,1});
		}
		else{
			int l,r,k;scanf("%d%d%d",&l,&r,&k);
			q.push_back((que){++tot,l,r,k,++oo,0});
		}
	}
	sort(b+1,b+1+pp);
	c1=unique(b+1,b+1+pp)-b-1;
//	printf("dd:%d\n",c1);
//	sort(q.begin(),q.end(),cmp);
	for(unsigned int i=0;i