Skip to content

Fix English version of lazysegtree doc #180

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Apr 19, 2025
Merged

Fix English version of lazysegtree doc #180

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions document_en/lazysegtree.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -126,7 +126,7 @@ It returns `op(a[0], ..., a[n - 1])`, assuming the properties of the monoid. It

```cpp
(1) int seg.max_right<g>(int l)
(2 ) int seg.max_right<G>(int l, G g)
(2💻) int seg.max_right<G>(int l, G g)
```

- (1): It applies a binary search on the segment tree. The function `bool g(S x)` should be defined.
Expand All @@ -153,7 +153,7 @@ If `g` is monotone, this is the maximum `r` that satisfies `g(op(a[l], a[l + 1],

```cpp
(1) int seg.min_left<g>(int r)
(2 ) int seg.min_left<G>(int r, G g)
(2💻) int seg.min_left<G>(int r, G g)
```

- (1): It applies a binary search on the segment tree. The function `bool g(S x)` should be defined.
Expand Down