diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-05-01 18:07:15 +0200 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-05-01 18:07:15 +0200 |
| commit | a24ce98f2c79d5594d171a9b294b1cf25b488ebc (patch) | |
| tree | b7f672a8a027bee24c8b926a083560ce8ac9b1ed /datastructures/segmentTree.cpp | |
| parent | 2d09c91b8e3a4482ed94fab44ec1aab42ab72da9 (diff) | |
improve test system, fix segment tree, add more segment tree tests
Diffstat (limited to 'datastructures/segmentTree.cpp')
| -rw-r--r-- | datastructures/segmentTree.cpp | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/datastructures/segmentTree.cpp b/datastructures/segmentTree.cpp index 2cbf466..4f75d03 100644 --- a/datastructures/segmentTree.cpp +++ b/datastructures/segmentTree.cpp @@ -4,14 +4,15 @@ struct SegTree { vector<T> tree; static constexpr T E = 0; // Neutral element for combine - SegTree(vector<T>& a) : n(ssize(a)), tree(2 * n) { - //SegTree(int size, T val = E) : n(size), tree(2 * n, val) { + SegTree(vector<T>& a) : n(ssize(a)), tree(2 * n, E) { ranges::copy(a, tree.begin() + n); + //SegTree(int size, T val = E) : n(size), tree(2 * n, E) { + // fill(tree.begin() + n, tree.end(), val); for (int i = n - 1; i > 0; i--) { // remove for range update tree[i] = comb(tree[2 * i], tree[2 * i + 1]); }} - ll comb(T a, T b) {return a + b;} // modify this + neutral + ll comb(T a, T b) { return a + b; } // modify this + neutral void update(int i, T val) { tree[i += n] = val; // apply update code |