Refactor query function in seg_tree.hpp

lrvideckis · web-flow · commit 7718bf6feecb · 2026-01-18T02:53:55.000-07:00
Fix formatting and improve query function readability.
diff --git a/library/data_structures_[l,r]/seg_tree.hpp b/library/data_structures_[l,r]/seg_tree.hpp
@@ -24,7 +24,7 @@ template<class T, class F> struct tree {
     for (s[i += n] = val; i /= 2;)
       s[i] = op(s[2 * i], s[2 * i + 1]);
   }
-  T query(int l, int r) { // [l, r]
+  T query(int l, int r) {
     T res = s[nxt(l += n, r += n)];
     while (l <= r) res = op(res, s[nxt(l, r)]);
     return res;

Original file line number	Diff line number	Diff line change
`@@ -24,7 +24,7 @@ template<class T, class F> struct tree {`
`24`	`24`	`for (s[i += n] = val; i /= 2;)`
`25`	`25`	`s[i] = op(s[2 * i], s[2 * i + 1]);`
`26`	`26`	`}`
`27`		`- T query(int l, int r) { // [l, r]`
	`27`	`+ T query(int l, int r) {`
`28`	`28`	`T res = s[nxt(l += n, r += n)];`
`29`	`29`	`while (l <= r) res = op(res, s[nxt(l, r)]);`
`30`	`30`	`return res;`