We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 66c6885 commit 066c0e8Copy full SHA for 066c0e8
library/data_structures_[l,r)/seg_tree.hpp
@@ -19,7 +19,7 @@ template<class T, class F> struct tree {
19
for (s[i += n] = val; i /= 2;)
20
s[i] = op(s[2 * i], s[2 * i + 1]);
21
}
22
- T query(int l, int r) { // [l, r)
+ T query(int l, int r) {
23
T x = unit, y = unit;
24
for (l += n, r += n; l < r; l /= 2, r /= 2) {
25
if (l % 2) x = op(x, s[l++]);
0 commit comments