diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 01:24:14 +0100 |
| commit | 98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch) | |
| tree | 5113d5cc24d1ad5f93810b6442ce584a36950dc8 /datastructures/sparseTableDisjoint.cpp | |
| parent | ad3856a6b766087df0036de0b556f4700a6498c9 (diff) | |
| parent | 8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff) | |
mzuenni tests
Diffstat (limited to 'datastructures/sparseTableDisjoint.cpp')
| -rw-r--r-- | datastructures/sparseTableDisjoint.cpp | 26 |
1 files changed, 0 insertions, 26 deletions
diff --git a/datastructures/sparseTableDisjoint.cpp b/datastructures/sparseTableDisjoint.cpp deleted file mode 100644 index dc5297a..0000000 --- a/datastructures/sparseTableDisjoint.cpp +++ /dev/null @@ -1,26 +0,0 @@ -struct DisjointST { - static constexpr ll neutral = 0; - vector<vector<ll>> dst; - ll* a; - - ll combine(const ll& x, const ll& y) { - return x + y; - } - - void init(vector<ll> &vec) { - int n = sz(vec); - a = vec.data(); - dst.assign(__lg(n) + 1, vector<ll>(n + 1, neutral)); - for (int h = 0, l = 1; l <= n; h++, l *= 2) { - for (int c = l; c < n + l; c += 2 * l) { - for (int i = c; i < min(n, c + l); i++) - dst[h][i + 1] = combine(dst[h][i], vec[i]); - for (int i = min(n, c); i > c - l; i--) - dst[h][i - 1] = combine(vec[i - 1], dst[h][i]); - }}} - - ll query(int l, int r) { - int h = __lg(l ^ r); - return combine(dst[h][l], dst[h][r]); - } -}; |
