add min left now

Author: lrvideckis

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

@@ -32,4 +32,5 @@ template<class T, class F> struct tree {
     return op(x, y);
   }
 #include "seg_tree_uncommon/max_right.hpp"
+#include "seg_tree_uncommon/min_left.hpp"
 };

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

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

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

@@ -39,4 +39,5 @@ template<class T, class F> struct tree {
     return x;
   }
 #include "seg_tree_uncommon/max_right.hpp"
+#include "seg_tree_uncommon/min_left.hpp"
 };

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

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