BZOJ_2989_数列&&BZOJ_4170_极光_KDTree

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 200050
#define ls ch[p][0]
#define rs ch[p][1]
#define _min(x,y) ((x)<(y)?(x):(y))
#define _max(x,y) ((x)>(y)?(x):(y))
int ch[N][2],mx[N][2],mn[N][2],siz[N],now,root,val[N],n;
struct Point {
	int p[2];
	bool operator < (const Point &x) const {
		return p[now]==x.p[now]?p[!now]<x.p[!now]:p[now]<x.p[now];
	}
}a[N];
inline char nc() {
	static char buf[100000],*p1,*p2;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
char rc() {
	char s=nc();
	while(s!=‘Q‘&&s!=‘M‘) s=nc();
	return s;
}
int rd() {
	int x=0; char s=nc();
	while(s<‘0‘||s>‘9‘) s=nc();
	while(s>=‘0‘&&s<=‘9‘) x=(x<<3)+(x<<1)+s-‘0‘,s=nc();
	return x;
}
void pushup(int p,int x) {
	int i;
	for(i=0;i<2;i++) mn[p][i]=_min(mn[p][i],mn[x][i]),mx[p][i]=_max(mx[p][i],mx[x][i]);
	siz[p]+=siz[x];
}
int build(int l,int r,int type) {
	int mid=(l+r)>>1; now=type;
	nth_element(a+l,a+mid,a+r+1);
	int i;
	for(i=0;i<2;i++) mn[mid][i]=mx[mid][i]=a[mid].p[i];
	siz[mid]=1;
	ch[mid][0]=ch[mid][1]=0;
	if(l<mid) ch[mid][0]=build(l,mid-1,!type),pushup(mid,ch[mid][0]);
	if(r>mid) ch[mid][1]=build(mid+1,r,!type),pushup(mid,ch[mid][1]);
	return mid;
}
void insert(int x) {
	int p=root;
	now=0; 
	mx[x][0]=mn[x][0]=a[x].p[0];
	mx[x][1]=mn[x][1]=a[x].p[1];
	siz[x]=1;
	while(1) {
		pushup(p,x);
		if(a[x]<a[p]) {
			if(ls) p=ls;
			else {ls=x; return ;}
		}else {
			if(rs) p=rs;
			else {rs=x; return ;}
		}
		now=!now;
	}
}
int Abs(int x) {return x>0?x:-x;}
int dismin(int x,int y,int p) {
	return _max(mn[p][0]-x,0)+_max(x-mx[p][0],0)+_max(mn[p][1]-y,0)+_max(y-mx[p][1],0);
}
int dismax(int x,int y,int p) {
	return max(Abs(x-mx[p][0]),Abs(x-mn[p][0]))+max(Abs(y-mx[p][1]),Abs(y-mn[p][1]));
}
int query(int x,int y,int k,int p) {
	if(dismax(x,y,p)<=k) return siz[p];
	int re=0;
	if(Abs(a[p].p[0]-x)+Abs(a[p].p[1]-y)<=k) re++;
	if(ls&&dismin(x,y,ls)<=k) re+=query(x,y,k,ls);
	if(rs&&dismin(x,y,rs)<=k) re+=query(x,y,k,rs);
	return re;
}
int main() {
	n=rd(); int Q=rd();
	int i,x,y;
	for(i=1;i<=n;i++) {
		val[i]=rd();
		a[i]=(Point){i,val[i]};
	}
	root=build(1,n,0);
	while(Q--) {
		char opt=rc();
		x=rd(); y=rd();
		if(opt==‘Q‘) {
			printf("%d\n",query(x,val[x],y,root));
		}else {
			val[x]=y;
			a[++n]=(Point){x,y};
			insert(n);
			if(n%10000==0) root=build(1,n,0);
		}
	}
}