Codeforces Round #742 (Div. 2) E. Non-Decreasing Dilemma 线段树

题意

给你一个长度为$n$的序列$w$，两种操作：
1 x y：将$w[x]$变成$y$
2 l r：求$l,r$区间内上升子串个数

分析

与线段树维护区间最大子段和类似。

使用线段树维护以下几个值：
$lsum$最大上升前缀长度
$rsum$最大上升后缀长度
$flag$该区间是否是上升区间
$tot$该区间满足条件的上升子串个数

代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define endl '\n'
const int N = 1e6 + 10, M = N * 2;
int n, m, w[N];
struct Node{
    int l, r;
    ll lsum, rsum;
    bool flag;
    ll tot;
}tr[N];
void pushup(Node &u, Node &l, Node &r){
    u.l = l.l, u.r = r.r;
    if(l.flag && r.flag && w[l.r] <= w[r.l]) u.flag = 1;
    else u.flag = 0;
    if(l.flag && w[l.r] <= w[r.l]) u.lsum = l.r - l.l + 1 + r.lsum;
    else u.lsum = l.lsum;
    if(r.flag && w[l.r] <= w[r.l]) u.rsum = r.r - r.l + 1 + l.rsum;
    else u.rsum = r.rsum;
    if(w[l.r] <= w[r.l]) u.tot = (ll) (l.tot + r.tot + l.rsum * r.lsum);
    else u.tot = l.tot + r.tot;
}
void pushup(int u){
    pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}
void build(int u, int l, int r){
    tr[u].l = l, tr[u].r = r;
    if(l == r){
        tr[u] = {l, r, 1, 1, 1, 1};
    }else{
        int mid = (l + r) >> 1;
        build(u << 1, l, mid);
        build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }
}
void update(int u, int x, int v){
    if(x == tr[u].l && x == tr[u].r){
        tr[u] = {x, x, 1, 1, 1, 1};
        w[x] = v;
    }else{
        int mid = (tr[u].l + tr[u].r) >> 1;
        if(x <= mid) update(u << 1, x, v);
        else update(u << 1 | 1, x, v);
        pushup(u);
    }
}
Node query(int u, int l, int r){
    if(l <= tr[u].l && tr[u].r <= r){
        return tr[u];
    }else{
        int mid = (tr[u].l + tr[u].r) >> 1;
        if(r <= mid) return query(u << 1, l, r);
        else if(l > mid) return query(u << 1 | 1, l, r);
        else{
            Node res, L = query(u << 1, l, r), R = query(u << 1 | 1, l, r);
            pushup(res, L, R);
            return res;
        }
    }
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i];
    build(1, 1, n);
    for (int i = 1; i <= m; i++){
        int op, x, y; cin >> op >> x >> y;
        if(op == 1) update(1, x, y);
        else cout << query(1, x, y).tot << endl;
    }
    return 0;
}