fix #26: fix min_left/max_right document of lazyseg

atcoder · Sep 12, 2020 · 316b7ef · 316b7ef
1 parent b9fbc16
commit 316b7ef
Show file tree

Hide file tree

Showing 2 changed files with 12 additions and 12 deletions.
diff --git a/document_en/lazysegtree.md b/document_en/lazysegtree.md
@@ -137,12  137,12 @@ It returns an index `r` that satisfies both of the followings.
 - `r = l` or `g(op(a[l], a[l   1], ..., a[r - 1])) = true`
 - `r = n` or `g(op(a[l], a[l   1], ..., a[r])) = false`
 
-If `f` is monotone, this is the maximum `r` that satisfies `g(op(a[l], a[l   1], ..., a[r - 1])) = true`.
 If `g` is monotone, this is the maximum `r` that satisfies `g(op(a[l], a[l   1], ..., a[r - 1])) = true`.
 
 **@{keyword.constraints}**
 
-- if `f` is called with the same argument, it returns the same value, i.e., `f` has no side effect.
-- `f(e_s()) = true`
 - if `g` is called with the same argument, it returns the same value, i.e., `g` has no side effect.
 - `g(e()) = true`
 - $0 \leq l \leq n$
 
 **@{keyword.complexity}**
@@ -164,12  164,12 @@ It returns an index `l` that satisfies both of the following.
 - `l = r` or `g(op(a[l], a[l   1], ..., a[r - 1])) = true`
 - `l = 0` or `g(op(a[l - 1], a[l], ..., a[r - 1])) = false`
 
-If `f` is monotone, this is the minimum `l` that satisfies `g(op(a[l], a[l   1], ..., a[r - 1])) = true`.
 If `g` is monotone, this is the minimum `l` that satisfies `g(op(a[l], a[l   1], ..., a[r - 1])) = true`.
 
 **@{keyword.constraints}**
 
-- if `f` is called with the same argument, it returns the same value, i.e., `f` has no side effect.
-- `f(e_s()) = true`
 - if `g` is called with the same argument, it returns the same value, i.e., `g` has no side effect.
 - `g(e()) = true`
 - $0 \leq r \leq n$
 
 **@{keyword.complexity}**

diff --git a/document_ja/lazysegtree.md b/document_ja/lazysegtree.md
@@ -138,12  138,12 @@ S seg.all_prod()
 - `r = l` もしくは `g(op(a[l], a[l   1], ..., a[r - 1])) = true`
 - `r = n` もしくは `g(op(a[l], a[l   1], ..., a[r])) = false`
 
-`f`が単調だとすれば、`g(op(a[l], a[l   1], ..., a[r - 1])) = true` となる最大の `r`、と解釈することが可能です。
 `g`が単調だとすれば、`g(op(a[l], a[l   1], ..., a[r - 1])) = true` となる最大の `r`、と解釈することが可能です。
 
 **@{keyword.constraints}**
 
-- `f`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
-- `f(e_s()) = true`
 - `g`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
 - `g(e()) = true`
 - $0 \leq l \leq n$
 
 **@{keyword.complexity}**
@@ -165,12  165,12 @@ S seg.all_prod()
 - `l = r` もしくは `g(op(a[l], a[l   1], ..., a[r - 1])) = true`
 - `l = 0` もしくは `g(op(a[l - 1], a[l], ..., a[r - 1])) = false`
 
-`f`が単調だとすれば、`g(op(a[l], a[l   1], ..., a[r - 1])) = true` となる最小の `l`、と解釈することが可能です。
 `g`が単調だとすれば、`g(op(a[l], a[l   1], ..., a[r - 1])) = true` となる最小の `l`、と解釈することが可能です。
 
 **@{keyword.constraints}**
 
-- `f`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
-- `f(e_s()) = true`
 - `g`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
 - `g(e()) = true`
 - $0 \leq r \leq n$
 
 **@{keyword.complexity}**