DataStructure/SegTree/SegTree.h

• View this file on GitHub
• Last update: 2025-05-20 14:35:59+07:00

Depends on

• template.h

Verified with

• DataStructure/Point_add_range_sum.test.cpp

Code

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

template <typename T>
struct SegTree {
    int n;
    vector<T> tree;

    SegTree() {}
    SegTree(int _n): n(_n), tree(_n*4) {}

    void update(int pos, T val) {
        update(1, 1, n, pos, val);
    }

    T getSum(int u, int v) {
        return getSum(1, 1, n, u, v);
    }

    void update(int id, int l, int r, int pos, T val) {
        if (pos < l || pos > r) return;
        if (l == r) {
            tree[id] += val;
            return;
        }
        int mid = (l + r) >> 1;
        update(id*2, l, mid, pos, val);
        update(id*2+1, mid+1, r, pos, val);
        tree[id] = tree[id*2] + tree[id*2+1];
    }

    T getSum(int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (l >= u && r <= v) return tree[id];
        int mid = (l + r) >> 1;
        T t1 = getSum(id*2, l, mid, u, v);
        T 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/SegTree.h"

template <typename T>
struct SegTree {
    int n;
    vector<T> tree;

    SegTree() {}
    SegTree(int _n): n(_n), tree(_n*4) {}

    void update(int pos, T val) {
        update(1, 1, n, pos, val);
    }

    T getSum(int u, int v) {
        return getSum(1, 1, n, u, v);
    }

    void update(int id, int l, int r, int pos, T val) {
        if (pos < l || pos > r) return;
        if (l == r) {
            tree[id] += val;
            return;
        }
        int mid = (l + r) >> 1;
        update(id*2, l, mid, pos, val);
        update(id*2+1, mid+1, r, pos, val);
        tree[id] = tree[id*2] + tree[id*2+1];
    }

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

Back to top page