some fixes

Author: lrvideckis

library/data_structures_[l,r)/seg_tree_uncommon/merge_sort_tree.hpp

@@ -1,5 +1,5 @@
 #pragma once
-#include "../lazy_seg_tree_midpoint.hpp"
+#include "../seg_tree_midpoint.hpp"
 struct merge_sort_tree {
   int n;
   vector<vi> tree;

library/strings/longest_common_subsequence/lcs_queries.hpp

@@ -1,5 +1,5 @@
 #pragma once
-#include "../../data_structures/bit.hpp"
+#include "../../data_structures_[l,r)/bit.hpp"
 #include "lcs_dp.hpp"
 //! @code
 //!   string s,t;

library/strings/suffix_array/suffix_array_query.hpp

@@ -1,6 +1,6 @@
 #pragma once
 #include "suffix_array.hpp"
-#include "../../data_structures/rmq.hpp"
+#include "../../data_structures_[l,r)/rmq.hpp"
 #include "find/match.hpp"
 //! @code
 //!   string s;

tests/library_checker_aizu_tests/data_structures/deque_sliding_window.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_3_D"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/deque_op.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/deque_op.hpp"
 int mn(int x, int y) { return min(x, y); }
 int main() {
   cin.tie(0)->sync_with_stdio(0);

tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc.test.cpp

@@ -1,13 +1,13 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/disjoint_rmq_inc.hpp"
+#include "../../../library/data_structures_[l,r]/disjoint_rmq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
   vi a(n);
   for (int i = 0; i < n; i++) cin >> a[i];
-  disjoint_rmq_inc rmq(a,
+  disjoint_rmq rmq(a,
     [](int x, int y) { return min(x, y); });
   while (q--) {
     int l, r;

tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_lines.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/queue_operate_all_composite"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/disjoint_rmq_inc.hpp"
+#include "../../../library/data_structures_[l,r]/disjoint_rmq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   const ll mod = 998'244'353;
@@ -20,7 +20,7 @@ int main() {
       lines.emplace_back(queries[i].a, queries[i].b);
     } else if (queries[i].type == 2) cin >> queries[i].x;
   }
-  disjoint_rmq_inc rmq(lines,
+  disjoint_rmq rmq(lines,
     [](const auto& a, const auto& b) {
       // f1(x) = a.first * x + a.second
       // f2(x) = b.first * x + b.second

…ata_structures/disjoint_rmq_sum.test.cpp …structures/disjoint_rmq_inc_sum.test.cpptests/library_checker_aizu_tests/data_structures/disjoint_rmq_sum.test.cpp renamed to tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_sum.test.cpp tests/library_checker_aizu_tests/data_structures/disjoint_rmq_sum.test.cpp renamed to tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_sum.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/static_range_sum"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/disjoint_rmq.hpp"
+#include "../../../library/data_structures_[l,r]/disjoint_rmq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
@@ -12,6 +12,6 @@ int main() {
   while (q--) {
     int l, r;
     cin >> l >> r;
-    cout << rmq.query(l, r) << '\n';
+    cout << rmq.query(l, r - 1) << '\n';
   }
 }

tests/library_checker_aizu_tests/data_structures/disjoint_rmq_lines.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/area_of_union_of_rectangles"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/implicit.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/implicit.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;

tests/library_checker_aizu_tests/data_structures/implicit_seg_tree.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/range_kth_smallest"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/kth_smallest_query.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/kth_smallest_query.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;