We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 696e6c3 commit c7ca468Copy full SHA for c7ca468
library/data_structures/seg_tree_uncommon/merge_sort_tree.hpp
@@ -6,10 +6,9 @@ struct merge_sort_tree {
6
merge_sort_tree(const vi& a): n(sz(a)), tree(2 * n) {
7
int pw2 = bit_ceil(size(a));
8
rep(i, 0, n) tree[(i + pw2) % n + n] = {a[i]};
9
- for (int i = n - 1; i >= 1; i--) {
+ for (int i = n - 1; i >= 1; i--)
10
ranges::merge(tree[2 * i], tree[2 * i + 1],
11
back_inserter(tree[i]));
12
- }
13
}
14
//! count of i in [l, r) such that a[i] in [vl, vr)
15
//! @time O(log(n)^2)
0 commit comments