Fix bugs for segment trees; Release 0.2.3

Author: Mr-Python-in-China

library/mrpython/lazy_segment_tree.hpp

@@ -23,7 +23,7 @@ class lazy_segment_tree {
     data.reserve(2 * n - 1), size.reserve(2 * n - 1);
     for (size_t i = n; i < 2 * n - 1; ++i) {
       size_t d = 2 * n - 1 - i;
-      size_t l = d * 2 + 1, r = d * 2;
+      size_t l = d * 2, r = d * 2 + 1;
       data.emplace_back(mergeData(data[2 * n - 1 - l], data[2 * n - 1 - r]));
       size.emplace_back(size[2 * n - 1 - l] + size[2 * n - 1 - r]);
     }

library/mrpython/typical_segment_tree.hpp

@@ -22,7 +22,7 @@ template <typename T, typename MergeFunction> class typical_segment_tree {
     data.reserve(2 * n - 1), size.reserve(2 * n - 1);
     for (size_t i = n; i < 2 * n - 1; ++i) {
       size_t d = 2 * n - 1 - i;
-      size_t l = d * 2 + 1, r = d * 2;
+      size_t l = d * 2, r = d * 2 + 1;
       data.emplace_back(merge(data[2 * n - 1 - l], data[2 * n - 1 - r]));
       size.emplace_back(size[2 * n - 1 - l] + size[2 * n - 1 - r]);
     }

package.json

@@ -2,7 +2,7 @@
   "name": "mp-oi-library",
   "displayName": "mp-oi-library",
   "description": "Some algorithms and data structures template for competitive programming.",
-  "version": "0.2.2",
+  "version": "0.2.3",
   "repository": "https://github.com/Mr-Python-in-China/mp-oi-library",
   "license": "LGPL-3.0-only",
   "author": {