fix

Author: lrvideckis

tests/.config/.cppcheck_suppression_list

@@ -53,7 +53,6 @@ constVariableReference:library_checker_aizu_tests/handmade_tests/dsu_size.test.c
 constVariableReference:../library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp:34
 constVariablePointer:../kactl/content/numerical/FastFourierTransform.h:39
 cstyleCast:../kactl/content/numerical/FastFourierTransform.h:39
-derefInvalidIterator:../library/data_structures_[l,r]/linear_rmq.hpp:28
 derefInvalidIterator:library_checker_aizu_tests/handmade_tests/n_choose_k.test.cpp:13
 unreadVariable:library_checker_aizu_tests/handmade_tests/permutation_tree_small.test.cpp:12
 uninitvar:library_checker_aizu_tests/handmade_tests/seg_tree_find_small.test.cpp:41

tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp

@@ -8,11 +8,6 @@ int main() {
   vector<int> a(n);
   for (int i = 0; i < n; i++) cin >> a[i];
   linear_rmq rmq_less(a, less());
-  linear_rmq rmq_less_equal(a, less_equal());
-  vector<int> neg_a(n);
-  for (int i = 0; i < n; i++) neg_a[i] = -a[i];
-  linear_rmq rmq_greater(neg_a, greater());
-  linear_rmq rmq_greater_equal(neg_a, greater_equal());
   while (q--) {
     int l, r;
     cin >> l >> r;
@@ -22,16 +17,6 @@ int main() {
              a[idx_right_min]);
     assert(l <= idx_right_min && idx_right_min < r);
     assert(rmq_less.query(l, r - 1) == a[idx_right_min]);
-    assert(idx_right_min == rmq_greater.idx(l, r - 1));
-    int idx_left_min = rmq_less_equal.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.idx(l, r - 1));
-    assert(a[idx_right_min] == a[idx_left_min]);
-    assert(idx_left_min <= idx_right_min);
     cout << a[idx_right_min] << '\n';
   }
 }