题目:
题解:
被平衡树的思路局限了,本来想写两棵平衡树,其实只需要一棵线段树+一棵平衡树就好了
对于MIN_GAP操作我们用线段树,叶子节点维护左端值,插入的时候修改右端点的值,然后维护区间最小值就好了
对于MIN_SORT_GAP操作我们用平衡树维护大小关系
1A真是满意
代码:
#include <algorithm>
#include <cstdio>
#include <iostream>
#define INF 1e9
using namespace std;
const int N=1000005;
int sm,minn[N*4],ch[N][2],f[N],key[N],root,sz,segl[N*4],segr[N*4],a[N];
int get(int x){return ch[f[x]][1]==x;}
void rotate(int x)
{
int old=f[x],oldf=f[old],which=get(x);
f[x]=oldf; if (oldf) ch[oldf][get(old)]=x;
ch[old][which]=ch[x][which^1]; f[ch[x][which^1]]=old;
ch[x][which^1]=old; f[old]=x;
}
void splay(int x)
{
for (;f[x];rotate(x))
if (f[f[x]]) rotate(get(x)==get(f[x])?f[x]:x);
root=x;
}
int pre()
{
int now=ch[root][0];
while (ch[now][1]) now=ch[now][1];
return now;
}
int nxt()
{
int now=ch[root][1];
while (ch[now][0]) now=ch[now][0];
return now;
}
void insert(int x)
{
if (!root){sz++;key[sz]=x;root=sz;return;}
int now=root,fa=0;
while (1)
{
if (key[now]==x) {sm=0;return;}
fa=now;
now=ch[now][key[now]<x];
if (!now)
{
sz++; f[sz]=fa;
key[sz]=x; ch[fa][key[fa]<x]=sz;
splay(sz);
int l=pre();
if (l) sm=min(sm,abs(key[l]-x));
int r=nxt();
if (r) sm=min(sm,abs(key[r]-x));
return;
}
}
}
void updata(int now)
{
segl[now]=segl[now<<1];
segr[now]=segr[now<<1|1];
minn[now]=min(minn[now<<1],minn[now<<1|1]);
minn[now]=min(minn[now],abs(segr[now<<1]-segl[now<<1|1]));
}
void build(int now,int l,int r)
{
minn[now]=INF;
if (l==r)
{
segl[now]=segr[now]=a[l];
return;
}
int mid=(l+r)>>1;
build(now<<1,l,mid);
build(now<<1|1,mid+1,r);
updata(now);
}
void change(int now,int l,int r,int x,int v)
{
if (l==r)
{
minn[now]=min(minn[now],abs(v-segr[now]));
segr[now]=v;return;
}
int mid=(l+r)>>1;
if (x<=mid) change(now<<1,l,mid,x,v);
else change(now<<1|1,mid+1,r,x,v);
updata(now);
}
int main()
{
int n,m;scanf("%d%d",&n,&m);sm=INF;
for (int i=1;i<=n;i++) scanf("%d",&a[i]),insert(a[i]);
build(1,1,n);
for (int i=1;i<=m;i++)
{
char st[15];int x,v;
scanf("%s",st);
if (st[0]=='I')
{
scanf("%d%d",&x,&v);
change(1,1,n,x,v);
insert(v);
}
else if (st[4]=='G') printf("%d\n",minn[1]);
else printf("%d\n",sm);
}
}