fix

Author: lrvideckis

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

@@ -5,18 +5,14 @@
 //!     return vl + vr;
 //!   });
 //!   tree st(a, ranges::min);
-//!   int idx = st.max_right(l, r, [&](int value) {
+//!   st.max_right(l, r, [&](int m, int value) {
+//!     // value = op(a[l], a[l+1], ..., a[m])
 //!     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) {
+//!   st.min_left(l, r, [&](int m, int value) {
+//!     // value = op(a[m], ..., a[r-1], a[r])
 //!     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)

library/data_structures_[l,r]/seg_tree_uncommon/max_right.hpp

@@ -1,9 +1,9 @@
 void max_right(int l, int r, const auto& f) {
-  if (T x = s[l + n]; f(x, l))
+  if (T x = s[l + n]; f(l, x))
     for (l++; l <= r;) {
       int u = l + n, v = __lg(min(u & -u, r - l + 1)),
           m = l + (1 << v) - 1;
-      if (T y = op(x, s[u >> v]); f(y, m))
+      if (T y = op(x, s[u >> v]); f(m, y))
         l = m + 1, x = y;
       else r = m - 1;
     }

library/data_structures_[l,r]/seg_tree_uncommon/min_left.hpp

@@ -1,9 +1,9 @@
 int min_left(int l, int r, const auto& f) {
-  if (T x = s[r + n]; f(x, r))
+  if (T x = s[r + n]; f(r, x))
     for (r--; l <= r;) {
       int u = r + 1 + n, v = __lg(min(u & -u, r - l + 1)),
           m = r - (1 << v) + 1;
-      if (T y = op(s[(u - 1) >> v], x); f(y, m))
+      if (T y = op(s[(u - 1) >> v], x); f(m, y))
         r = m - 1, x = y;
       else l = m + 1;
     }

tests/library_checker_aizu_tests/data_structures/simple_tree_inc_line.test.cpp

@@ -32,8 +32,8 @@ int main() {
         array<int, 2> walk_res = {1, 0};
         int idx = -1;
         st.max_right(l, r,
-          [&](const array<int, 2>& curr_line,
-            int m) -> bool {
+          [&](int m,
+            const array<int, 2>& curr_line) -> bool {
             idx = m;
             walk_res = curr_line;
             return 1;
@@ -45,8 +45,8 @@ int main() {
         array<int, 2> walk_res = unit;
         int idx = -1;
         st.max_right(l, r,
-          [&](const array<int, 2>& curr_line,
-            int m) -> bool {
+          [&](int m,
+            const array<int, 2>& curr_line) -> bool {
             walk_res = curr_line;
             idx = m;
             return 0;
@@ -58,8 +58,8 @@ int main() {
         array<int, 2> walk_res = unit;
         int idx = -1;
         st.min_left(l, r,
-          [&](const array<int, 2>& curr_line,
-            int m) -> bool {
+          [&](int m,
+            const array<int, 2>& curr_line) -> bool {
             walk_res = curr_line;
             idx = m;
             return 1;
@@ -71,8 +71,8 @@ int main() {
         array<int, 2> walk_res = unit;
         int idx = -1;
         st.min_left(l, r,
-          [&](const array<int, 2>& curr_line,
-            int m) -> bool {
+          [&](int m,
+            const array<int, 2>& curr_line) -> bool {
             walk_res = curr_line;
             idx = m;
             return 0;

tests/library_checker_aizu_tests/data_structures/simple_tree_inc_walk.test.cpp

@@ -23,7 +23,7 @@ int main() {
     } else if (type == 3) {
       // returns first element in [k,n-1] such that mx > 0
       int idx = -1;
-      st.max_right(k, n - 1, [&](int mx, int m) {
+      st.max_right(k, n - 1, [&](int m, int mx) {
         if (mx == 0) return 1;
         idx = m;
         return 0;
@@ -32,7 +32,7 @@ int main() {
     } else {
       assert(type == 4);
       int idx = -1;
-      cout << st.min_left(0, k, [&](int mx, int m) {
+      cout << st.min_left(0, k, [&](int m, int mx) {
         if (mx == 0) return 1;
         idx = m;
         return 0;