DataStructure/SegTree/SegTreeBeats/SegTreeBeats2.h

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00

Depends on

• template.h

Required by

• DataStructure/SegTree/SegTreeBeats/test2.cpp

Code

#include "../../../template.h"


struct Node {
    ll max1, max2, cntMax, sum, lazy;

    Node() {}

    Node(int val) {
        max1 = val;
        max2 = -1;
        cntMax = 1;
        sum = val;
        lazy = -1;
    }

    Node operator+(const Node &b) {
        Node res;
        res.max1 = max(max1, b.max1);
        res.max2 = max(max2, b.max2);
        if (res.max1 != max1) res.max2 = max(res.max2, max1);
        if (res.max1 != b.max1) res.max2 = max(res.max2, b.max1); 
        res.cntMax = 0;
        if (res.max1 == max1) res.cntMax += cntMax;
        if (res.max1 == b.max1) res.cntMax += b.cntMax;
        res.sum = sum + b.sum;
        res.lazy = -1;
        return res;
    }

    void setMin(int val) {
        if (val > max1) return;
        sum -= (max1 - val) * cntMax;
        max1 = val;
        lazy = val;
    }
};

// range chmin, sum
class SegTreeBeats {
public:
    vector<Node> tree;

    SegTreeBeats(int n): tree(4*n) {}

    void build(int id, int l, int r, int u, int v, int val) {
        if (l > v || r < u) return;
        if (u <= l && r <= v) {
            tree[id] = Node(val);
            return;
        }
        int mid = (l + r) >> 1;
        build(id*2, l, mid, u, v, val);
        build(id*2+1, mid+1, r, u, v, val);
        tree[id] = tree[id*2] + tree[id*2+1];
    }   

    void push(int id) {
        if (tree[id].lazy < 0) return;
        tree[id*2].setMin(tree[id].lazy);
        tree[id*2+1].setMin(tree[id].lazy);
        tree[id].lazy = -1;
    }

    void updateChmin(int id, int l, int r, int u, int v, int x) {
        if (l > v || r < u) return;
        if (tree[id].max1 <= x) return;
        if (u <= l && r <= v && tree[id].max2 < x) {
            tree[id].setMin(x);
            return;
        }
        push(id);
        int mid = (l + r) >> 1;
        updateChmin(id*2, l, mid, u, v, x);
        updateChmin(id*2+1, mid+1, r, u, v, x);
        tree[id] = tree[id*2] + tree[id*2+1];
    }

    ll getSum(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (u <= l && r <= v) return tree[id].sum;
        push(id);
        int mid = (l + r) >> 1;
        ll t1 = getSum(id*2, l, mid, u, v);
        ll t2 = getSum(id*2+1, mid+1, r, u, v);
        return t1 + t2;
    }
};

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "DataStructure/SegTree/SegTreeBeats/SegTreeBeats2.h"


struct Node {
    ll max1, max2, cntMax, sum, lazy;

    Node() {}

    Node(int val) {
        max1 = val;
        max2 = -1;
        cntMax = 1;
        sum = val;
        lazy = -1;
    }

    Node operator+(const Node &b) {
        Node res;
        res.max1 = max(max1, b.max1);
        res.max2 = max(max2, b.max2);
        if (res.max1 != max1) res.max2 = max(res.max2, max1);
        if (res.max1 != b.max1) res.max2 = max(res.max2, b.max1); 
        res.cntMax = 0;
        if (res.max1 == max1) res.cntMax += cntMax;
        if (res.max1 == b.max1) res.cntMax += b.cntMax;
        res.sum = sum + b.sum;
        res.lazy = -1;
        return res;
    }

    void setMin(int val) {
        if (val > max1) return;
        sum -= (max1 - val) * cntMax;
        max1 = val;
        lazy = val;
    }
};

// range chmin, sum
class SegTreeBeats {
public:
    vector<Node> tree;

    SegTreeBeats(int n): tree(4*n) {}

    void build(int id, int l, int r, int u, int v, int val) {
        if (l > v || r < u) return;
        if (u <= l && r <= v) {
            tree[id] = Node(val);
            return;
        }
        int mid = (l + r) >> 1;
        build(id*2, l, mid, u, v, val);
        build(id*2+1, mid+1, r, u, v, val);
        tree[id] = tree[id*2] + tree[id*2+1];
    }   

    void push(int id) {
        if (tree[id].lazy < 0) return;
        tree[id*2].setMin(tree[id].lazy);
        tree[id*2+1].setMin(tree[id].lazy);
        tree[id].lazy = -1;
    }

    void updateChmin(int id, int l, int r, int u, int v, int x) {
        if (l > v || r < u) return;
        if (tree[id].max1 <= x) return;
        if (u <= l && r <= v && tree[id].max2 < x) {
            tree[id].setMin(x);
            return;
        }
        push(id);
        int mid = (l + r) >> 1;
        updateChmin(id*2, l, mid, u, v, x);
        updateChmin(id*2+1, mid+1, r, u, v, x);
        tree[id] = tree[id*2] + tree[id*2+1];
    }

    ll getSum(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (u <= l && r <= v) return tree[id].sum;
        push(id);
        int mid = (l + r) >> 1;
        ll t1 = getSum(id*2, l, mid, u, v);
        ll t2 = getSum(id*2+1, mid+1, r, u, v);
        return t1 + t2;
    }
};

Back to top page