UESTC 360 Another LCIS（线段树 x 经典区间合并姿势）

题意：
定义 CLIS 为在原序列中连续的一段构成的 LIS。
两种操作
a）给某个区间加上一个值
b ) 询问区间 CLIS
思路：
。。。

const int N = 100000 + 5;

#define lc o<<1
#define rc o<<1|1

int g_len;

struct Node {
    int lv, rv, l, r, m, add;

    void upd(int x) {
        lv += x;
        rv += x;
        add += x;
    }
}tr[N<<2], g_node;

void cat(const Node& rhs, int R) {
        Node tmp = g_node;
        tmp.lv = g_node.lv;
        tmp.rv = rhs.rv;
        if ( g_node.m == g_len && g_node.rv < rhs.lv ) {
            tmp.l = g_len + rhs.l;
        } else {
            tmp.l = g_node.l;
        }
        if ( rhs.m == R && g_node.rv < rhs.lv ) {
            tmp.r = g_node.r + R;
        } else {
            tmp.r = rhs.r;
        }
        if ( g_node.rv < rhs.lv ) {
            tmp.m = max ( max ( g_node.m, rhs.m ), g_node.r + rhs.l );
        } else {
            tmp.m = max ( g_node.m, rhs.m );
        }
        g_node = tmp;
        g_len += R;
}

void push_down(int o) {
    if ( tr[o].add != 0 ) {
        tr[lc].upd(tr[o].add);
        tr[rc].upd(tr[o].add);
        tr[o].add = 0;
    }
}

void push_up(int o, int L, int R) {
    tr[o].lv = tr[lc].lv;
    tr[o].rv = tr[rc].rv;
    if ( tr[lc].m == L && tr[lc].rv < tr[rc].lv ) {
        tr[o].l = L + tr[rc].l;
    } else {
        tr[o].l = tr[lc].l;
    }
    if ( tr[rc].m == R && tr[lc].rv < tr[rc].lv ) {
        tr[o].r = R + tr[lc].r;
    } else {
        tr[o].r = tr[rc].r;
    }
    if ( tr[lc].rv < tr[rc].lv ) {
        tr[o].m = max ( max (tr[lc].m, tr[rc].m), tr[lc].r + tr[rc].l );
    } else {
        tr[o].m = max (tr[lc].m, tr[rc].m);
    }
    tr[o].add = 0;
}

void build(int o, int l, int r) {
    if ( l == r ) {
        int x;
        scanf("%d", &x);
        tr[o] = (Node) {x, x, 1, 1, 1, 0};
    } else {
        int m = (l + r) >> 1;
        build(lc, l, m); build(rc, m+1, r);
        push_up(o, m - l + 1, r - m);
    }
}

int qL, qR;
void modify(int o, int l, int r, int v) {
    if ( qL <= l && r <= qR ) {
        tr[o].upd(v); return;
    }
    push_down(o);
    int m = (l + r) >> 1;
    if ( qL <= m )
        modify(lc, l, m, v);
    if ( qR > m )
        modify(rc, m+1, r, v);
    push_up(o, m - l + 1, r - m);
}

void query(int o, int l, int r) {
    if ( qL <= l && r <= qR ) {
        if ( l == qL ) {
            g_node = tr[o];
            g_len = r - l + 1;
        } else {
            cat(tr[o], r - l + 1);
        }
        return;
    }
    push_down(o);
    int m = (l + r) >> 1;
    if ( qL <= m )
        query(lc, l, m);
    if ( qR > m )
        query(rc, m+1, r);
    push_up(o, m - l + 1, r - m);
}

int main() {
    int t, cas = 0;
    scanf("%d", &t);
    while( t -- ) {
        printf("Case #%d:\n", ++ cas);
        int n, q;
        scanf("%d%d", &n, &q);

        build(1, 1, n);

        char ch; int x;
        rep(i, 1, q) {
            for (ch = getchar(); ch == ' ' || ch == '\n'; ch = getchar());
            if ( ch == 'a' ) {
                scanf("%d%d%d", &qL, &qR, &x);
                modify(1, 1, n, x);
            } else if ( ch == 'q' ) {
                scanf("%d%d", &qL, &qR);
                query(1, 1, n);
                printf("%d\n", g_node.m);
            } else throw runtime_error("...");
        }

    }
    return 0;
}