BZOJ1058(ZJOI2007)报表统计--STL

【链接】
bzoj1058

【解题报告】

好像是平衡树裸题。但时限15s，stl乱搞就过了。

其实就只需记录每个位置的第一个数和最后一个数就可以确定最小值，然后stl乱搞就行了。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
using namespace std;
const int maxn=500005,INF=1<<30;
int n,m,MIN,a[maxn],st[maxn],gl[maxn];
set <int> S,B;
map <int,int> mp;
inline char nc()
{
    static char *l,*r,buf[100000];
    if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
    if (l==r) return EOF; return *l++;
}
inline int Read()
{
    int res=0,f=1; char ch=nc(),cc=ch;
    while (ch<'0'||ch>'9') cc=ch,ch=nc();
    if (cc=='-') f=-1;
    while (ch>='0'&&ch<='9') res=res*10+ch-48,ch=nc();
    return res*f;
}
int Abs(int x) {if (x<0) return (-x); return x;}
void Insert(int x) {mp[x]++; if (mp[x]==1) B.insert(x);}
void Push(int where,int p)
{
    if (where<n) {int t=Abs(gl[where]-st[where+1]); mp[t]--; if (!mp[t]) B.erase(t);}
    Insert(Abs(p-gl[where])); Insert(Abs(p-st[where+1]));
    int x=*--S.lower_bound(p),y=*S.lower_bound(p);
    MIN=min(MIN,min(Abs(p-x),Abs(p-y)));
    S.insert(p); gl[where]=p; 
}
int main()
{
    freopen("1058.in","r",stdin);
    freopen("1058.out","w",stdout);
    n=Read(); m=Read(); MIN=INF;
    while (!B.empty()) B.clear();
    while (!S.empty()) S.clear();
    S.insert(INF); S.insert(-INF);
    for (int i=1; i<=n; i++) a[i]=st[i]=gl[i]=Read(),S.insert(st[i]);
    sort(a+1,a+1+n); for (int i=2; i<=n; i++) Insert(Abs(st[i]-st[i-1])),MIN=min(MIN,Abs(a[i]-a[i-1]));
    for (int i=1; i<=m; i++)
    {
        char ch=nc();
        while (ch!='I'&&ch!='M') ch=nc();
        if (ch=='I')
         {
            int x=Read(),p=Read();
            Push(x,p); continue;
         }
        nc(); nc(); nc(); ch=nc();
        if (ch=='G') printf("%d\n",*B.begin()); else printf("%d\n",MIN);
    }
    return 0;
}