HUD 3308 LCIS -- 线段树

HUD 3308 LCIS
老套路维护以下几个值：
区间最长的递增序列的长度sum
以区间左端点为起点的向右的最长递增序列的长度lsum
以区间右端点为起点的向左的最长递增序列的长度rsum
区间左端点的值lval
区间右端点的值rval

对于push_up操作
先常规的根据左右节点更新当前节点的值

tree[root].lsum = tree[root << 1].lsum;
tree[root].rsum = tree[root << 1 | 1].rsum;
tree[root].sum = max(tree[root << 1].sum, tree[root << 1 | 1].sum);
tree[root].lval = tree[root << 1].lval;
tree[root].rval = tree[root << 1 | 1].rval;

对于左节点的右端点的值小于右节点的左端点的值时
说明可以合并，此时最长递增的区间可能是由合并后的得来需要更新

if (tree[root << 1].rval < tree[root << 1 | 1].lval) {
	   if (tree[root << 1].len() == tree[root << 1].lsum)tree[root].lsum += tree[root << 1 | 1].lsum;
	   if (tree[root << 1 | 1].len() == tree[root << 1 | 1].rsum)tree[root].rsum += tree[root << 1].rsum;
	   tree[root].sum = max(tree[root].sum, tree[root << 1].rsum + tree[root << 1 | 1].lsum);//中间区域
}
tree[root].sum = max(tree[root].sum, max(tree[root].lsum, tree[root].rsum));//两边区域

#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {//Parameter pack
    auto tmp = { (cout << args << ' ', 0)... };
    cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 1e9 + 7;
int w[N];
struct node {
    int l, r;
    int sum, lsum, rsum;
    int lval, rval;
    int len() { return r - l + 1; }
};
struct Segtree {
    node tree[N << 2];
    void push_up(int root) {
        tree[root].lsum = tree[root << 1].lsum;
        tree[root].rsum = tree[root << 1 | 1].rsum;
        tree[root].sum = max(tree[root << 1].sum, tree[root << 1 | 1].sum);
        tree[root].lval = tree[root << 1].lval;
        tree[root].rval = tree[root << 1 | 1].rval;

        if (tree[root << 1].rval < tree[root << 1 | 1].lval) {
            if (tree[root << 1].len() == tree[root << 1].lsum)tree[root].lsum += tree[root << 1 | 1].lsum;
            if (tree[root << 1 | 1].len() == tree[root << 1 | 1].rsum)tree[root].rsum += tree[root << 1].rsum;
            tree[root].sum = max(tree[root].sum, tree[root << 1].rsum + tree[root << 1 | 1].lsum);//中间区域
        }
        tree[root].sum = max(tree[root].sum, max(tree[root].lsum, tree[root].rsum));//两边区域
    }
    void build(int root, int l, int r) {
        if (l == r)tree[root] = { l,r,1,1,1,w[l],w[l] };
        else {
            tree[root] = { l,r };
            int mid = l + r >> 1;
            build(root << 1, l, mid);
            build(root << 1 | 1, mid + 1, r);
            push_up(root);
        }
    }
    void modify(int root, int pos, int val) {
        if (tree[root].l == tree[root].r && tree[root].l == pos) {
            tree[root].lval = tree[root].rval = val;
        }
        else {
            int mid = tree[root].l + tree[root].r >> 1;
            if (pos <= mid)modify(root << 1, pos, val);
            if (pos > mid)modify(root << 1 | 1, pos, val);
            push_up(root);
        }
    }
    int query(int root, int l,int r) {
        if (l<=tree[root].l&&tree[root].r<=r)return tree[root].sum;
        else {
            int mid = tree[root].l + tree[root].r >> 1;
            if (r <= mid) return query(root << 1, l, r);
            else if (l > mid) return query(root << 1 | 1, l, r);
            else{
                int tmp1 = 0, tmp2 = 0;
                int mx1 = query(root << 1, l, r);
                int mx2 = query(root << 1 | 1, l, r);
                if (tree[root << 1].rval < tree[root << 1 | 1].lval) {
                    tmp1 = min(mid - l + 1, tree[root << 1].rsum);
                    tmp2 = min(r - mid, tree[root << 1 | 1].lsum);
                }
                return max(max(mx1, mx2), tmp1 + tmp2);
            }
        }
    }
}seg;

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        for (int i = 1; i <= n; i++)cin >> w[i];
        seg.build(1, 1, n);
        for (int i = 0; i < m; i++) {
            string op;
            cin >> op;
            if (op[0] == 'Q') {
                int l, r;
                cin >> l >> r;
                l++, r++;
                cout << seg.query(1, l, r) << "\n";
            }
            else {
                int pos, val;
                cin >> pos >> val;
                pos++;
                seg.modify(1, pos, val);
            }
        }
    }

    return 0;
}