BZOJ 1058: [ZJOI2007]报表统计

题目：http://www.lydsy.com/JudgeOnline/problem.php?id=1058

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <string.h>
#include <queue>
#include <vector>
#include <algorithm>
#include <cassert>
#include <set>
#include <map>
#include <cmath>
#include <ctime>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
#define clr(a,x) memset(a,(x),sizeof(a))
#define eps 1e-8
#define LL long long
#define mp make_pair
const int maxn=500000+5;
const int inf=0x7ffffff;
int bottom[maxn],top[maxn];
int n,m;
char s[30];
multiset<int> min_gap;
multiset<int> value_set;
typedef multiset<int>::iterator iter;
typedef multiset<int>::reverse_iterator riter;
inline int min(int a,int b) { return a<b?a:b; }
inline int max(int a,int b) { return a>b?a:b; }
inline int abs(int x) { return x<0?-x:x; }
 
void read_int(int&x)
{
    char ch=getchar();
    while(ch<'0'||ch>'9') ch=getchar();
    x=ch-'0'; ch=getchar();
    while('0'<=ch&&ch<='9') {
        x=x*10+ch-'0';
        ch=getchar();
    }
}
 
int main()
{
    //freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&m)==2) {
        min_gap.clear(); value_set.clear();
        rep(i,1,n+1) {
            int x; //read_int(x);
            scanf("%d",&x);
            bottom[i]=top[i]=x; value_set.insert(x);
            if(i>1) min_gap.insert(abs(top[i]-top[i-1]));
        }
        int sort_gao=inf,pre=inf;
        for(iter it=value_set.begin();it!=value_set.end();++it) { sort_gao=min(sort_gao,abs(*it-pre)); pre=*it; }
 
        int p,k;
        while(m--) {
            scanf("%s",s);
            if(s[0]=='I') {
                //read_int(p); read_int(k);
                scanf("%d%d",&p,&k);
                if(sort_gao) {
                    iter it=value_set.insert(k);
                    if(it!=value_set.begin()) { --it; sort_gao=min(sort_gao,abs(*it-k)); ++it; }
                    if(it!=value_set.end()) { ++it; sort_gao=min(sort_gao,abs(*it-k)); --it; }
                }
                min_gap.insert(abs(k-top[p]));
                if(p!=n) {
                    min_gap.erase(min_gap.find(abs(top[p]-bottom[p+1])));
                    min_gap.insert(abs(bottom[p+1]-k));
                }
                top[p]=k;
            } else if(s[4]=='G') printf("%d\n",*(min_gap.begin()));
            else printf("%d\n",sort_gao);
        }
    }
}