update

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp

@@ -22,6 +22,7 @@ int main() {
     assert(rmq_less.query(l, r - 1) == a[idx_right_min]);
     assert(idx_right_min == rmq_greater.query_idx(l, r - 1));
     int idx_left_min = rmq_less_equal.query_idx(l, r - 1);
+    assert(l == idx_left_min || rmq_less_equal.query(l, idx_left_min - 1) > a[idx_left_min]);
     assert(l <= idx_left_min && idx_left_min < r);
     assert(idx_left_min == rmq_greater_equal.query_idx(l, r - 1));
     assert(a[idx_right_min] == a[idx_left_min]);

…u_tests/data_structures/rmq_inc.test.cpp …structures/rmq_sparse_table_inc.test.cpptests/library_checker_aizu_tests/data_structures/rmq_inc.test.cpp renamed to tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp tests/library_checker_aizu_tests/data_structures/rmq_inc.test.cpp renamed to tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp

@@ -7,8 +7,7 @@ int main() {
   cin >> n >> q;
   vector<int> a(n);
   for (int i = 0; i < n; i++) cin >> a[i];
-  rmq_inc rmq(a,
-    [&](auto& x, auto& y) { return min(x, y); });
+  rmq_inc rmq(a, ranges::min);
   while (q--) {
     int l, r;
     cin >> l >> r;

tests/library_checker_aizu_tests/mono_st_asserts.hpp

@@ -2,7 +2,6 @@
 #include "../../library/monotonic_stack/monotonic_range.hpp"
 #include "../../library/monotonic_stack/cartesian_binary_tree.hpp"
 #include "../../library/monotonic_stack/cartesian_k_ary_tree.hpp"
-#include "../../library/data_structures/rmq.hpp"
 #include "../../library/data_structures/uncommon/linear_rmq.hpp"
 tuple<int, vector<vector<int>>, vector<int>>
 min_cartesian_tree(const vector<int>& a,
@@ -38,9 +37,6 @@ void mono_st_asserts(const vector<int>& a) {
   compares.push_back(greater_equal());
   int n = sz(a);
   for (auto cmp : compares) {
-    vector<int> init(n);
-    iota(begin(init), end(init), 0);
-    linear_rmq lin_rmq(a, cmp);
     auto l = mono_st(a, cmp), r = mono_range(l),
          p = cart_binary_tree(l);
     {
@@ -65,8 +61,6 @@ void mono_st_asserts(const vector<int>& a) {
         assert(cmp(a[i], a[j]));
         assert(cmp(a[i], a[r[j] - 1]));
         assert(cmp(a[i], a[j + (r[j] - j) / 2]));
-        int range_op = a[rmq.query(j, r[j])];
-        assert(cmp(a[i], range_op));
         iterations++;
       }
     }