Codeforces 295E Yaroslav and Points 线段树

Yaroslav and Points

明明区间合并一下就好的东西， 为什么我会写得这么麻烦的方法啊啊啊。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ull unsigned long long

using namespace std;

const int N = 2e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-;
const double PI = acos(-);

vector<int> oo;
int getPos(int x) {
    return lower_bound(oo.begin(), oo.end(), x) - oo.begin() + ;
}
int getPosL(int x) {
    return lower_bound(oo.begin(), oo.end(), x) - oo.begin() + ;
}
int getPosR(int x) {
    return upper_bound(oo.begin(), oo.end(), x) - oo.begin();
}

namespace SGT {
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
    LL sum[N << ], cnt[N << ];
    LL lazya[N << ], lazyb[N << ], all[N << ];
    inline void push(int rt) {
        if(lazya[rt]) {
            lazya[rt << ] += lazya[rt];
            lazya[rt <<  | ] += lazya[rt];
            all[rt << ] += cnt[rt << ] * lazya[rt];
            all[rt <<  | ] += cnt[rt <<  | ] * lazya[rt];
            lazya[rt] = ;
        }
        if(lazyb[rt]) {
            lazyb[rt << ] += lazyb[rt];
            lazyb[rt <<  | ] += lazyb[rt];
            all[rt << ] += sum[rt << ] * lazyb[rt];
            all[rt <<  | ] += sum[rt <<  | ] * lazyb[rt];
            lazyb[rt] = ;
        }
    }
    inline void pull(int rt) {
        sum[rt] = sum[rt << ] + sum[rt <<  | ];
        cnt[rt] = cnt[rt << ] + cnt[rt <<  | ];
        all[rt] = all[rt << ] + all[rt <<  | ];
    }
    void modify1(int p, LL val, int l, int r, int rt) {
        if(l == r) {
            cnt[rt] += val;
            sum[rt] += oo[l - ] * val;
            if(!cnt[rt]) all[rt] = ;
            return;
        }
        push(rt);
        int mid = l + r >> ;
        if(p <= mid) modify1(p, val, lson);
        else modify1(p, val, rson);
        pull(rt);
    }
    void modify2(int L, int R, LL val, int l, int r, int rt) {
        if(L > R) return;
        if(l >= L && r <= R) {
            lazya[rt] += val;
            all[rt] += val * cnt[rt];
            return;
        }
        push(rt);
        int mid = l + r >> ;
        if(L <= mid) modify2(L, R, val, lson);
        if(R > mid)  modify2(L, R, val, rson);
        pull(rt);
    }
    void modify3(int L, int R, LL val, int l, int r, int rt) {
        if(L > R) return;
        if(l >= L && r <= R) {
            lazyb[rt] += val;
            all[rt] += val * sum[rt];
            return;
        }
        push(rt);
        int mid = l + r >> ;
        if(L <= mid) modify3(L, R, val, lson);
        if(R > mid)  modify3(L, R, val, rson);
        pull(rt);
    }
    PLL query1(int L, int R, int l, int r, int rt) {
        if(L > R) return mk(, );
        if(l >= L && r <= R) return mk(sum[rt], cnt[rt]);
        push(rt);
        int mid = l + r >> ;
        PLL ans = mk(, ), tmp = mk(, );
        if(L <= mid) {
            tmp = query1(L, R, lson);
            ans.fi += tmp.fi; ans.se += tmp.se;
        }
        if(R > mid) {
            tmp = query1(L, R, rson);
            ans.fi += tmp.fi; ans.se += tmp.se;
        }
        return ans;
    }
    LL query2(int L, int R, int l, int r, int rt) {
        if(L > R) return ;
        if(l >= L && r <= R) return all[rt];
        push(rt);
        int mid = l + r >> ;
        LL ans = ;
        if(L <= mid) ans += query2(L, R, lson);
        if(R > mid)  ans += query2(L, R, rson);
        return ans;
    }
}

int n, m, x[N], c[N];
pair<PII, int> qus[N];

int main() {
    scanf("%d", &n);
    for(int i = ; i <= n; i++) {
        scanf("%d", &x[i]);
        c[i] = x[i];
        oo.push_back(x[i]);
    }
    scanf("%d", &m);
    for(int i = ; i <= m; i++) {
        scanf("%d%d%d", &qus[i].se, &qus[i].fi.fi, &qus[i].fi.se);
        if(qus[i].se == ) {
            c[qus[i].fi.fi] += qus[i].fi.se;
            oo.push_back(c[qus[i].fi.fi]);
        }
    }
    sort(oo.begin(), oo.end());
    oo.erase(unique(oo.begin(), oo.end()), oo.end());
    for(int i = ; i <= n; i++) SGT::modify1(getPos(x[i]), , , SZ(oo), );
    for(int i = ; i <= n; i++) {
        PLL add = SGT::query1(getPos(x[i]), SZ(oo), , SZ(oo), );
        SGT::modify2(getPos(x[i]), getPos(x[i]), add.fi, , SZ(oo), );
        SGT::modify3(getPos(x[i]), getPos(x[i]), -add.se, , SZ(oo), );
    }
    for(int i = ; i <= m; i++) {
        if(qus[i].se == ) {
            int p = qus[i].fi.fi, d = qus[i].fi.se;
            if(d > ) {
                SGT::modify1(getPos(x[p]), -, , SZ(oo), );
                SGT::modify2(, getPos(x[p]) - , d, , SZ(oo), );
                SGT::modify2(getPos(x[p]) + , getPos(x[p] + d) - , x[p] + d, , SZ(oo), );
                SGT::modify3(getPos(x[p]) + , getPos(x[p] + d) - , -, , SZ(oo), );
                x[p] += d;
                SGT::modify1(getPos(x[p]), , , SZ(oo), );
                PLL add = SGT::query1(getPos(x[p]), SZ(oo), , SZ(oo), );
                SGT::modify2(getPos(x[p]), getPos(x[p]), add.fi, , SZ(oo), );
                SGT::modify3(getPos(x[p]), getPos(x[p]), -add.se, , SZ(oo), );
            } else if(d < ) {
                d = -d;
                SGT::modify1(getPos(x[p]), -, , SZ(oo), );
                SGT::modify2(, getPos(x[p] - d) - , -d, , SZ(oo), );
                SGT::modify2(getPos(x[p] - d) + , getPos(x[p]) - , -x[p], , SZ(oo), );
                SGT::modify3(getPos(x[p] - d) + , getPos(x[p]) - , , , SZ(oo), );
                x[p] -= d;
                SGT::modify1(getPos(x[p]), , , SZ(oo), );
                PLL add = SGT::query1(getPos(x[p]), SZ(oo), , SZ(oo), );
                SGT::modify2(getPos(x[p]), getPos(x[p]), add.fi, , SZ(oo), );
                SGT::modify3(getPos(x[p]), getPos(x[p]), -add.se, , SZ(oo), );
            }
        } else {
            int L = qus[i].fi.fi, R = qus[i].fi.se;
            L = getPosL(L); R = getPosR(R);
            LL ans = SGT::query2(L, R, , SZ(oo), );
            PLL tmpL = SGT::query1(L, R, , SZ(oo), );
            PLL tmpR = SGT::query1(R + , SZ(oo), , SZ(oo), );
            ans -= tmpL.se * tmpR.fi;
            ans += tmpL.fi * tmpR.se;
            printf("%lld\n", ans);
        }
    }
    return ;
}

/*
*/