add more comments

Author: lrvideckis

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

@@ -7,10 +7,12 @@
 //!   });
 //!   tree st(n, LLONG_MAX, ranges::min);
 //!   st.max_right(l, r, [&](int m, ll value) {
+//!     // l < m <= r
 //!     // value = op(a[l], a[l+1], ..., a[m-1])
 //!     return value <= x;
 //!   });
 //!   st.min_left(l, r, [&](int m, ll value) {
+//!     // l <= m < r
 //!     // value = op(a[m], ..., a[r-2], a[r-1])
 //!     return value <= x;
 //!   });

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

@@ -6,10 +6,12 @@
 //!   });
 //!   tree st(n, LLONG_MAX, ranges::min);
 //!   st.max_right(l, r, [&](int m, ll value) {
+//!     // l <= m <= r
 //!     // value = op(a[l], a[l+1], ..., a[m])
 //!     return value <= x;
 //!   });
 //!   st.min_left(l, r, [&](int m, ll value) {
+//!     // l <= m <= r
 //!     // value = op(a[m], ..., a[r-1], a[r])
 //!     return value <= x;
 //!   });