split up rmq test

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/rmq_all_methods.test.cpp

@@ -0,0 +1,16 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
+#include "../template.hpp"
+#include "../../../library/data_structures/uncommon/disjoint_rmq.hpp"
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, q;
+  cin >> n >> q;
+  vector<int> a(n);
+  for (int i = 0; i < n; i++) cin >> a[i];
+  disjoint_rmq dis_rmq(a, ranges::min);
+  while (q--) {
+    int l, r;
+    cin >> l >> r;
+    cout << dis_rmq.query(l, r) << '\n';
+  }
+}

tests/library_checker_aizu_tests/data_structures/rmq_disjoint_sparse_table.test.cpp

@@ -0,0 +1,19 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
+#include "../template.hpp"
+#include "../../../library/data_structures/uncommon/linear_rmq.hpp"
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, q;
+  cin >> n >> q;
+  vector<int> a(n);
+  for (int i = 0; i < n; i++) cin >> a[i];
+  linear_rmq lin_rmq(a, less());
+  while (q--) {
+    int l, r;
+    cin >> l >> r;
+    int idx_min = lin_rmq.query_idx(l, r - 1);
+    assert(l <= idx_min && idx_min < r);
+    assert(lin_rmq.query(l, r - 1) == a[idx_min]);
+    cout << a[idx_min] << '\n';
+  }
+}

tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp

@@ -0,0 +1,19 @@
+#define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
+#include "../template.hpp"
+#include "../mono_st_asserts.hpp"
+#include "../../../library/data_structures/rmq.hpp"
+int mn(int x, int y) { return min(x, y); }
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, q;
+  cin >> n >> q;
+  vector<int> a(n);
+  for (int i = 0; i < n; i++) cin >> a[i];
+  mono_st_asserts(a);
+  RMQ rmq(a, ranges::min);
+  while (q--) {
+    int l, r;
+    cin >> l >> r;
+    cout << rmq.query(l, r) << '\n';
+  }
+}