Commit 91102f7

authored

Merge pull request #180 from lucifer1004/patch-1

Fix English version of lazysegtree doc

2 parents 211d72a + c70d3c5 commit 91102f7Copy full SHA for 91102f7

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
@@ -126,7 +126,7 @@ It returns `op(a[0], ..., a[n - 1])`, assuming the properties of the monoid. It
`126`	`126`
`127`	`127`	```cpp
`128`	`128`	`(1) int seg.max_right<g>(int l)`
`129`		`-(2) int seg.max_right<G>(int l, G g)`
	`129`	`+(2💻) int seg.max_right<G>(int l, G g)`
`130`	`130`	```
`131`	`131`
`132`	`132`	- (1): It applies a binary search on the segment tree. The function `bool g(S x)` should be defined.
@@ -153,7 +153,7 @@ If `g` is monotone, this is the maximum `r` that satisfies `g(op(a[l], a[l + 1],
`153`	`153`
`154`	`154`	```cpp
`155`	`155`	`(1) int seg.min_left<g>(int r)`
`156`		`-(2) int seg.min_left<G>(int r, G g)`
	`156`	`+(2💻) int seg.min_left<G>(int r, G g)`
`157`	`157`	```
`158`	`158`
`159`	`159`	- (1): It applies a binary search on the segment tree. The function `bool g(S x)` should be defined.

Comments

(0)