UOJ#169 元旦老人与数列(线段树)

题目链接

思路：
$\ \ \ \ $16年的论文题，这里没有办法再用标记来做了， 但是除了历史最值之外都可以利用论文前面提到的方法来做，所以对于历史最值用那个方法额外再维护一下历史最值即可。$push\_down$的时候，当前的记录的历史最值只能传给有最小值的孩子，没有最小值的记录下历史加最小值，把这个历史加最小值传给这个孩子即可。这题卡常，加输入挂。

#include<bits/stdc++.h>
typedef long long ll;
const int maxn = 3e5 + 10;
const int MAXN = maxn << 2;
const ll INF = 2e9 + 10;
using namespace std;

int n, m, T, kase = 1, flag[MAXN];
int mn[MAXN], sn[MAXN], add[MAXN]; 
int b[MAXN], his_add[MAXN], his_min[MAXN];

const int MAX = 10000;
char buf[MAX], *ps = buf, *pe = buf + 1;
inline void rnext() {
    if(++ps == pe) pe = (ps = buf) + fread(buf, sizeof(char), sizeof(buf) / sizeof(char), stdin);
}
template <class T>
inline bool in(T &ans) {
    ans = 0;
    T f = 1;
    if(ps == pe) return false;//EOF
    do{
        rnext();
        if('-' == *ps) f = -1;
    } while(!isdigit(*ps) && ps != pe);
    if(ps == pe) return false;//EOF
    do {
        ans = (ans<<1)+(ans<<3)+*ps-48;
        rnext();
    } while(isdigit(*ps) && ps != pe);
    ans *= f;
    return true;
}
char bufout[MAX], outtmp[50],*pout = bufout, *pend = bufout + MAX;
inline void write() {
    fwrite(bufout, sizeof(char), pout - bufout, stdout);
    pout = bufout;
}
inline void out_char(char c) { *(pout++) = c; if(pout == pend) write(); }
inline void out_str(char *s) {
    while(*s) {
        *(pout++) = *(s++);
        if(pout == pend) write();
    }
}
template <class T>
inline void out_int(T x) {
    if(!x) {
        out_char('0');
        return;
    }
    if(x < 0) x = -x,out_char('-');
    int len = 0;
    while(x) {
        outtmp[len++] = x%10+48;
        x /= 10;
    }
    outtmp[len] = 0;
    for(int i = 0, j = len - 1; i < j; i++,j--) swap(outtmp[i],outtmp[j]);
    out_str(outtmp);
}

inline void push_up(int o) {
    int o1 = o << 1, o2 = o << 1 | 1;
    b[o] = min(b[o1], b[o2]);
    flag[o1] = flag[o2] = 0;
    if(mn[o1] < mn[o2]) {
        mn[o] = mn[o1];
        if(sn[o1] < mn[o2]) sn[o] = sn[o1];
        else sn[o] = mn[o2];
    } else if(mn[o1] > mn[o2]) {
        mn[o] = mn[o2];
        if(sn[o2] < mn[o1]) sn[o] = sn[o2];
        else sn[o] = mn[o1];
    } else {
        mn[o] = mn[o1];
        if(sn[o1] < sn[o2]) sn[o] = sn[o1];
        else sn[o] = sn[o2];
    }
    if(mn[o] == mn[o1]) flag[o1] = 1;
    if(mn[o] == mn[o2]) flag[o2] = 1;
}

inline void build(int o, int l, int r) {
    his_min[o] = INF;
    if(l == r) { in(mn[o]); sn[o] = INF; b[o] = mn[o]; return ; }
    int mid = (l + r) >> 1;
    build(o << 1, l, mid);
    build(o << 1 | 1, mid + 1, r);
    push_up(o);
}

inline void push_down(int o) {
    for(int i = 0; i < 2; i++) {
        int x = o << 1 | i;
        if(flag[x]) { b[x] = min(b[x], his_min[o]); his_min[x] = min(his_min[x], his_min[o]); }
        else { b[x] = min(b[x], mn[x] + his_add[o]); his_min[x] = min(his_min[x], mn[x] + his_add[o]); }
        mn[x] += add[o]; sn[x] += add[o]; 
        his_add[x] = min(his_add[x], add[x] + his_add[o]); add[x] += add[o]; 
        if(mn[x] < mn[o]) mn[x] = mn[o];
    } 
    add[o] = 0; his_add[o] = 0; his_min[o] = INF; 
}

inline bool update_max(int o, int x) {
    if(x <= mn[o]) return true;
    if(x < sn[o]) { mn[o] = x; return true; }
    return false;
}

void update(int o, int l, int r, int ql, int qr, int x, int flag) {
    if(l > qr || r < ql) return ;
    if(l >= ql && r <= qr) {
        bool tag;
        if(flag == 2) tag = update_max(o, x);
        else {
            his_add[o] = min(his_add[o], add[o] += x);
            mn[o] += x; sn[o] += x; tag = true;
            b[o] = min(b[o], mn[o]);
            his_min[o] = min(his_min[o], mn[o]);
        }
        if(tag) return ;
    }
    int mid = (l + r) >> 1; push_down(o);
    update(o << 1, l, mid, ql, qr, x, flag);
    update(o << 1 | 1, mid + 1, r, ql, qr, x, flag);
    push_up(o);
}

int query(int o, int l, int r, int ql, int qr, int flag) {
    if(l > qr || r < ql) return INF;
    if(l >= ql && r <= qr) {
        if(flag == 3) return mn[o];
        if(flag == 4) return b[o];
    }
    int mid = (l + r) >> 1; push_down(o);
    int p1 = query(o << 1, l, mid, ql, qr, flag);
    int p2 = query(o << 1 | 1, mid + 1, r, ql, qr, flag);
    push_up(o);
    return min(p1, p2);
}

int main() {
    int op, l, r, x;
    in(n); in(m);
    build(1, 1, n);
    while(m--) {
        in(op);
        if(op <= 2) in(l), in(r), in(x);
        else in(l), in(r);
        if(op <= 2) update(1, 1, n, l, r, x, op);
        else out_int(query(1, 1, n, l, r, op)), out_char('\n');
    }
    write();
    return 0;
}