We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent b154937 commit 30158acCopy full SHA for 30158ac
library/data_structures_[l,r]/seg_tree_uncommon/min_left.hpp
@@ -1,4 +1,4 @@
1
-int max_right(int l, int r, const auto& f) {
+int min_left(int l, int r, const auto& f) {
2
if (T x = s[r + n]; f(x))
3
while (l < r) {
4
int u = r + n, v = __lg(min(u & -u, r - l));
0 commit comments