[BZOJ1058]ZJOI2007报表统计|平衡树

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<set>
#define N 500005
#define inf 0x3fffffff
using namespace std;
int n,m,i,x,k,a
,ans=inf,last
;
char opt[20];
multiset<int> num,del;
multiset<int>::iterator it,l;
int main()
{
freopen("1058.in","r",stdin);
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
{
scanf("%d",&a[i]);
last[i]=a[i];
num.insert(a[i]);
if (i>1) del.insert(abs(a[i]-a[i-1]));
}
for (it=num.begin();it!=num.end();it++)
{
if (it!=num.begin()) ans=min(ans,*it-*l);
l=it;
}
num.insert(-inf);num.insert(inf);
for (i=1;i<=m;i++)
{
scanf("%s",opt);
if (opt[0]=='I')
{
scanf("%d%d",&x,&k);
it=num.insert(k);
ans=min(ans,k-*(--it));it++;it++;
ans=min(ans,*it-k);
it=del.find(abs(a[x+1]-last[x]));
del.erase(it);
del.insert(abs(last[x]-k));
del.insert(abs(k-a[x+1]));
last[x]=k;
}
else if (opt[4]=='S') printf("%d\n",ans);
else printf("%d\n",*del.begin());
}
}