golf

Author: lrvideckis

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

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