fixes

Author: lrvideckis

library/data_structures/uncommon/linear_rmq.hpp

@@ -24,16 +24,16 @@ template<class T, class F> struct linear_rmq {
       while (st.back() != -1 &&
         (i == n || !cmp(a[st.back()], a[i]))) {
         if (prev != -1) head[prev] = st.back();
-        int pw2 = bit_floor((end(st)[-2] + 1u) ^ i);
-        in[st.back()] = prev = i & -pw2;
+        int b = bit_floor((end(st)[-2] + 1u) ^ i);
+        in[st.back()] = prev = i & -b;
         st.pop_back();
-        asc[st.back() + 1] |= pw2;
+        asc[st.back() + 1] |= b;
       }
       if (prev != -1) head[prev] = i;
       st.push_back(i);
     }
-    rep(i, 1, n) asc[i] =
-      (asc[i] | asc[i - 1]) & -(in[i] & -in[i]);
+    rep(i, 1, n)(asc[i] |= asc[i - 1]) &=
+      -(in[i] & -in[i]);
   }
   int idx(int l, int r) { // [l, r]
     if (unsigned j = in[l] ^ in[r]; j) {

library/data_structures/uncommon/permutation_tree.hpp

@@ -37,8 +37,8 @@ struct perm_tree {
       linear_rmq rmq_min(a_inv, less());
       linear_rmq rmq_max(a_inv, greater());
       rep(i, 1, n) {
-        mn_i[i] = a_inv[rmq_min.query_idx(a[i - 1], a[i])];
-        mx_i[i] = a_inv[rmq_max.query_idx(a[i - 1], a[i])];
+        mn_i[i] = a_inv[rmq_min.idx(a[i - 1], a[i])];
+        mx_i[i] = a_inv[rmq_max.idx(a[i - 1], a[i])];
       }
     }
     rep(i, 0, n) allocate(i, a[i], 1, 0, {});

tests/library_checker_aizu_tests/handmade_tests/rmq_small_n.test.cpp

@@ -13,7 +13,7 @@ void test_all_subarrays(const vector<int>& a) {
   linear_rmq lin_rmq(a, less());
   for (int l = 0; l < n; l++) {
     for (int r = l + 1; r <= n; r++) {
-      int idx_min = lin_rmq.query_idx(l, r - 1);
+      int idx_min = lin_rmq.idx(l, r - 1);
       assert(l <= idx_min && idx_min < r);
       assert(a[idx_min] == rmq.query(l, r));
       assert(a[idx_min] == dis_rmq.query(l, r));