51nod1394 差和问题 值域线段树

水题.....

插入一个值$v$时，对于$[0, v - 1]$和$[v + 1, inf]$的点分别考虑就行了

删除相当于减去插入的贡献

用动态开点线段树卡点常数就过去了

复杂度$O(n \log n)$

#include <cstdio>
#include <cstring>
using namespace std;

extern inline char gc() {
    static char RR[], *S = RR + , *T = RR + ;
    if(S == T) fread(RR, , , stdin), S = RR;
    return *S ++;
}
inline int read() {
    int p = , w = ; char c = gc();
    while(c > '' || c < '') { if(c == '-') w = -; c = gc(); }
    while(c >= ''&& c <= '') p = p *  + c - '', c = gc();
    return p * w;
}

int wr[], rw;
#define pc(o) *O ++ = o
char WR[], *O = WR;
template <typename re>
inline void write(re x) {
    if(!x) pc('');
    if(x < ) x = -x, pc('-');
    while(x) wr[++ rw] = x % , x /= ;
    while(rw) pc(wr[rw --] + ''); pc('\n');
}

#define ll long long
#define ri register int
#define sid 5000050

ll ans;
ll sum[sid];
int n, q, id, rt;
int sz[sid], ls[sid], rs[sid];
const int inf = 1e9 + ;

inline void upd(int o) {
    sz[o] = sz[ls[o]] + sz[rs[o]];
    sum[o] = sum[ls[o]] + sum[rs[o]];
}

inline void ins(int &o, int l, int r, int p, int v) {
    if(!o) o = ++ id;
    if(l == r) { sz[o] += v; sum[o] = 1ll * sz[o] * p; return; }
    int mid = (l + r) >> ;
    if(p <= mid) ins(ls[o], l, mid, p, v);
    else ins(rs[o], mid + , r, p, v);
    upd(o);
}

inline ll qry(int o, int l, int r, int ml, int mr) {
    if(!o || ml > r || mr < l) return ;
    if(ml <= l && mr >= r) return sum[o];
    int mid = (l + r) >> ;
    return qry(ls[o], l, mid, ml, mr) + qry(rs[o], mid + , r, ml, mr);
}

inline int qsz(int o, int l, int r, int ml, int mr) {
    if(!o || ml > r || mr < l) return ;
    if(ml <= l && mr >= r) return sz[o];
    int mid = (l + r) >> ;
    return qsz(ls[o], l, mid, ml, mr) + qsz(rs[o], mid + , r, ml, mr);
}

inline void ins(int v, int opt) {
    if(opt == - && qsz(rt, , inf, v, v) == ) { write(-); return; }
    ins(rt, , inf, v, opt);
    ans += opt * (-qry(rt, , inf, , v - ) + 1ll * qsz(rt, , inf, , v - ) * v);
    ans += opt * (qry(rt, , inf, v + , inf) - 1ll * qsz(rt, , inf, v + , inf) * v);
}

int main() {
    n = read(); q = read();
    for(ri i = ; i <= n; i ++) ins(read(), );
    for(ri i = ; i <= q; i ++) {
        int opt = read();
        if(opt == ) ins(read(), );
        else if(opt == ) ins(read(), -);
        else write(ans);
    }
    fwrite(WR, , O - WR, stdout);
    return ;
}