Refactor nxt function for segment tree

Author: lrvideckis

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

@@ -11,8 +11,8 @@
 //! @time O(n + q log n)
 //! @space O(n)
 int nxt(int& l, int r) {
-  int lg = __lg(min(l & -l, r - l + 1));
-  return exchange(l, l + (1 << lg)) >> lg;
+  int x = min<int>(l & -l, bit_floor(r - l + 1u)));
+  return exchange(l, l + x) / x;
 }
 template<class T, class F> struct tree {
   int n;