[codevs]线段树练习5

http://codevs.cn/problem/4927/

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>

using namespace std;
const int N = 1e5 + ;

#define oo 1423333339
#define LL long long
#define gg 465432477

struct Node {
    LL l, r, w, f, mx, mi, fg;
    bool qs;
} T[N << ];
LL n, m, answer, maxn, minn;

inline LL read() {
    LL x = , f = ;
    char c = getchar();
    while(c < '' || c > '') { if(c == '-')f = -; c = getchar();}
    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();
    return x * f;
}

void imp(LL jd) {
    T[jd].w = T[jd << ].w + T[jd <<  | ].w;
    T[jd].mx = max(T[jd << ].mx, T[jd <<  | ].mx);
    T[jd].mi = min(T[jd << ].mi, T[jd <<  | ].mi);
}

void down(LL jd) {
    if(T[jd].qs) {
        T[jd << ].f = ;
        T[jd << ].qs = ;
        T[jd << ].fg = T[jd].fg;
        T[jd << ].w = (T[jd << ].r - T[jd << ].l + ) * T[jd].fg;

        T[jd <<  | ].f = ;
        T[jd <<  | ].qs = ;
        T[jd <<  | ].fg = T[jd].fg;
        T[jd <<  | ].w = (T[jd <<  | ].r - T[jd <<  | ].l + ) * T[jd].fg;

        T[jd << ].mi = T[jd << ].mx = T[jd <<  | ].mi= T[jd <<  | ].mx=T[jd].fg;

        T[jd].fg = ;
        T[jd].qs = ;
    }
    if(T[jd].f) {
        T[jd << ].f += T[jd].f;
        T[jd << ].w += (T[jd << ].r - T[jd << ].l + ) * T[jd].f;
        T[jd << ].mi += T[jd].f;
        T[jd << ].mx += T[jd].f;

        T[jd <<  | ].f += T[jd].f;
        T[jd <<  | ].w += (T[jd <<  | ].r - T[jd <<  | ].l + ) * T[jd].f;
        T[jd <<  | ].mi += T[jd].f;
        T[jd <<  | ].mx += T[jd].f;

        T[jd].f = ;
    }
    return ;
}

void build_tree(LL l, LL r, LL jd) {
    T[jd].l = l;
    T[jd].r = r;
    if(l == r) {
        T[jd].w = read();
        T[jd].mx = T[jd].w;
        T[jd].mi = T[jd].w;
        return ;
    }
    LL mid = (l + r) >> ;
    build_tree(l, mid, jd << );
    build_tree(mid + , r, jd <<  | );
    imp(jd);
}

void Sec_g(LL l, LL r, LL jd, LL x, LL y, LL yj) {
    if(x <= l && r <= y) {
        T[jd].f += yj;
        T[jd].w += (T[jd].r - T[jd].l + ) * yj;
        T[jd].mi += yj;
        T[jd].mx += yj;
        return ;
    }
    if(T[jd].f || T[jd].qs)
        down(jd);
    LL mid = (l + r) >> ;
    if(x <= mid)
        Sec_g(l, mid, jd << , x, y, yj);
    if(y > mid)
        Sec_g(mid + , r, jd <<  | , x, y, yj);
    imp(jd);
}

void Sec_set(LL l, LL r, LL jd, LL x, LL y, LL k) {
    if(x <= l && r <= y) {
        T[jd].fg = k;
        T[jd].qs = ;
        T[jd].w = (T[jd].r - T[jd].l + ) * T[jd].fg;
        T[jd].mx = k;
        T[jd].mi = k;
        T[jd].f = ;
        return ;
    }
    LL mid = (l + r ) >> ;
    if(T[jd].f || T[jd].qs)
        down(jd);
    if(x <= mid)
        Sec_set(l, mid, jd << , x, y, k);
    if(y > mid)
        Sec_set(mid + , r, jd <<  | , x, y, k);
    imp(jd);
}

void Sec_calc(LL l, LL r, LL jd, LL x, LL y) {
    if(x <= l && r <= y) {
        answer += T[jd].w;
        return;
    }
    if(T[jd].f || T[jd].qs)
        down(jd);
    LL mid = (l + r) >> ;
    if(x <= mid)
        Sec_calc(l, mid, jd << , x, y);
    if(y > mid)
        Sec_calc(mid + , r, jd <<  | , x, y);
}

void Sec_min(LL l, LL r, LL jd, LL x, LL y) {
    if(x <= l && r <= y) {
        minn = min(minn, T[jd].mi);
        return ;
    }
    if(T[jd].f || T[jd].qs)
        down(jd);
    LL mid = (l + r) >> ;
    if(x <= mid)
        Sec_min(l, mid, jd << , x, y);
    if(y > mid)
        Sec_min(mid + , r, jd <<  | , x, y);
}

void Sec_max(LL l, LL r, LL jd, LL x, LL y) {
    if(x <= l && r <= y) {
        maxn = max(maxn, T[jd].mx);
        return ;
    }
    if(T[jd].f || T[jd].qs)
        down(jd);
    LL mid = (l + r) >> ;
    if(x <= mid)
        Sec_max(l, mid, jd << , x, y);
    if(y > mid)
        Sec_max(mid + , r, jd <<  | , x, y);
}

int main() {
    freopen("gg.in", "r", stdin);
    n = read();
    m = read();
    build_tree(, n, );
    for(LL i = ; i <= m; i ++) {
        string s;
        cin >> s;
        LL x = read();
        LL y = read();
        if(s == "add") {
            LL k = read();
            Sec_g(, n, , x, y, k);
            continue;
        }
        if(s == "set") {
            LL k = read();
            Sec_set(, n, , x, y, k);
            continue;
        }
        if(s == "sum") {
            answer = ;
            Sec_calc(, n, , x, y);
            printf("%lld\n", answer);
            continue;
        }
        if(s == "min") {
            minn = oo;
            Sec_min(, n, , x, y);
            printf("%lld\n", minn);
            continue;
        }
        if(s == "max") {
            maxn = -oo;
            Sec_max(, n, , x, y);
            printf("%lld\n", maxn);
            continue;
        }
    }
    return ;
}
/*
10 6
3 9 2 8 1 7 5 0 4 6
add 4 9 4
set 2 6 2
sum 2 10
max 1 7
min 3 6
*/