update docs

Author: lrvideckis

library/data_structures_[l,r)/seg_tree.hpp

@@ -2,13 +2,22 @@
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/SegmentTree.h
 //! https://codeforces.com/blog/entry/118682
 //! @code
-//!   tree st1(n, INT_MAX, ranges::min);
-//!   tree st2(n, INT_MAX, [&](int x, int y) -> int {
-//!     return min(x, y);
+//!   tree st1(n, 0, [&](int vl, int vr) {
+//!     return vl + vr;
 //!   });
-//!   int idx = st2.walk(l, r, [&](int value) {
-//!     return value > x;
-//!   }); // min idx in [l, r) such that f is false
+//!   tree st(a, ranges::min);
+//!   int idx = st.max_right(l, r, [&](int value) {
+//!     return value <= x;
+//!   });
+//!   // idx in [l, r]
+//!   // f(op(a[l], a[l+1], ..., a[idx-1])) is true
+//!   // f(op(a[l], a[l+1], ..., a[idx])) is false
+//!   idx = st.min_left(l, r, [&](int value) {
+//!     return value <= x;
+//!   });
+//!   // idx in [l, r]
+//!   // f(op(a[idx+1], ..., a[r-2], a[r-1])) is true
+//!   // f(op(a[idx], ..., a[r-2], a[r-1])) is false
 //! @endcode
 //! @time O(n + q log n)
 //! @space O(n)

library/data_structures_[l,r]/seg_tree.hpp

@@ -1,20 +1,22 @@
 #pragma once
 //! https://codeforces.com/blog/entry/118682
 //! @code
-//!   {
-//!     tree st(a, [&](int vl, int vr) {
-//!       return vl & vr;
-//!     });
-//!   }
-//!   {
-//!     tree st(n, 0LL, plus<ll>{});
-//!   }
-//!   {
-//!     tree st(n, INT_MAX, ranges::min);
-//!     int idx = st.walk(l, r, [&](int value) {
-//!       return value <= x;
-//!     }); // smallest index in [l, r] s.t. f is false
-//!   }
+//!   tree st1(n, 0, [&](int vl, int vr) {
+//!     return vl + vr;
+//!   });
+//!   tree st(a, ranges::min);
+//!   int idx = st.max_right(l, r, [&](int value) {
+//!     return value <= x;
+//!   });
+//!   // idx in [l, r+1]
+//!   // f(op(a[l], a[l+1], ..., a[idx-1])) is true
+//!   // f(op(a[l], a[l+1], ..., a[idx])) is false
+//!   idx = st.min_left(l, r, [&](int value) {
+//!     return value <= x;
+//!   });
+//!   // idx in [l-1, r]
+//!   // f(op(a[idx+1], ..., a[r-1], a[r])) is true
+//!   // f(op(a[idx], ..., a[r-1], a[r])) is false
 //! @endcode
 //! @time O(n + q log n)
 //! @space O(n)