UESTC1425 Another LCIS

题目链接

题意没什么好说的，就是成段更新，然后求最长上升子序列，这次不同的是线段树上面加了两个域，一个是区间左端点，一个是区间右端点，用来处理合并条件，其他的都非常好说，就是传统的区间合并。

//不知到为啥RE。。找原因中……

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define lson l, m, rt << 1#define rson m + 1, r, rt << 1 | 1const int maxn = (int)1e5 + 20;int a[maxn];struct segtree{int llci[maxn << 3], rlci[maxn << 3], mlci[maxn << 3];int lval[maxn << 3], rval[maxn << 3], add[maxn << 3];void PushDown(int rt){if (add[rt]){add[rt << 1] += add[rt]; add[rt << 1 | 1] += add[rt]; lval[rt << 1] += add[rt]; lval[rt << 1 | 1] += add[rt]; rval[rt << 1] += add[rt]; rval[rt << 1 | 1] += add[rt]; add[rt] = 0;}}void PushUp(int l, int r, int rt){llci[rt] = llci[rt << 1]; lval[rt] = lval[rt << 1];rlci[rt] = rlci[rt << 1 | 1]; rval[rt] = rval[rt << 1 | 1];mlci[rt] = max(mlci[rt << 1], mlci[rt << 1 | 1]);if (rval[rt << 1] < lval[rt << 1 | 1]){int m = (l + r) >> 1;if (llci[rt] == m - l + 1) llci[rt] += llci[rt << 1 | 1];if (rlci[rt] == r - m) rlci[rt] += rlci[rt << 1];mlci[rt] = max(mlci[rt], llci[rt << 1 | 1] + rlci[rt << 1]);}mlci[rt] = max(llci[rt], max(rlci[rt], mlci[rt]));}void build(int l, int r, int rt){add[rt] = llci[rt] = rlci[rt] = mlci[rt] = 0;if (l == r){llci[rt] = rlci[rt] = mlci[rt] = 1;lval[rt] = rval[rt] = a[l];return;}int m = (l + r) >> 1;build(lson); build(rson);PushUp(l, r, rt);}void update(int ll, int rr, int val, int l, int r, int rt){if (ll <= l && rr >= r){lval[rt] += val; rval[rt] += val; add[rt] += val;return;}PushDown(rt);int m = (l + r) >> 1;if (ll <= m) update(ll, rr, val, lson);if (rr > m) update(ll, rr, val, rson);PushUp(l, r, rt);}int query(int ll, int rr, int l, int r, int rt){if (ll <= l && rr >= r) return mlci[rt];PushDown(rt);int m = (l + r) >> 1;if (rr <= m) return query(ll, rr, lson);else if (ll > m) return query(ll, rr, rson);else{int x = query(ll, m, lson);int y = query(m + 1, rr, rson);int z = 0;if (rval[rt << 1] < lval[rt << 1 | 1]){z += min(llci[rt << 1 | 1], rr - m);z += min(rlci[rt << 1], m - ll + 1);}return max(max(x, y), z);}}};segtree solver;int n, m;int main(){//#ifndef ONLINE_JUDGE//freopen("in", "rt", stdin);//#endifint cs; scanf("%d", &cs);for (int kase = 1; kase <= cs; kase++){scanf("%d%d", &n, &m);for (int i = 1; i <= n; i++)scanf("%d", &a[i]);solver.build(1, n, 1);printf("Case #%d:\n", kase);while(m--){char op[5];int x, y, z;scanf("%s", op);if (op[0] == 'a'){scanf("%d%d%d", &x, &y, &z);solver.update(x, y, z, 1, n, 1);}else{scanf("%d%d", &x, &y);int ans = solver.query(x, y, 1, n, 1);printf("%d\n", ans);}}}return 0;}