Skip to content

Commit 9e3dd6e

Browse files
authored
Merge pull request #28 from atcoder/patch/issue26
fix #26: fix min_left/max_right document of lazyseg
2 parents 055ee67 + 316b7ef commit 9e3dd6e

File tree

2 files changed

+12
-12
lines changed

2 files changed

+12
-12
lines changed

document_en/lazysegtree.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -137,12 +137,12 @@ It returns an index `r` that satisfies both of the followings.
137137
- `r = l` or `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`
138138
- `r = n` or `g(op(a[l], a[l + 1], ..., a[r])) = false`
139139

140-
If `f` is monotone, this is the maximum `r` that satisfies `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`.
140+
If `g` is monotone, this is the maximum `r` that satisfies `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`.
141141

142142
**@{keyword.constraints}**
143143

144-
- if `f` is called with the same argument, it returns the same value, i.e., `f` has no side effect.
145-
- `f(e_s()) = true`
144+
- if `g` is called with the same argument, it returns the same value, i.e., `g` has no side effect.
145+
- `g(e()) = true`
146146
- $0 \leq l \leq n$
147147

148148
**@{keyword.complexity}**
@@ -164,12 +164,12 @@ It returns an index `l` that satisfies both of the following.
164164
- `l = r` or `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`
165165
- `l = 0` or `g(op(a[l - 1], a[l], ..., a[r - 1])) = false`
166166

167-
If `f` is monotone, this is the minimum `l` that satisfies `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`.
167+
If `g` is monotone, this is the minimum `l` that satisfies `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`.
168168

169169
**@{keyword.constraints}**
170170

171-
- if `f` is called with the same argument, it returns the same value, i.e., `f` has no side effect.
172-
- `f(e_s()) = true`
171+
- if `g` is called with the same argument, it returns the same value, i.e., `g` has no side effect.
172+
- `g(e()) = true`
173173
- $0 \leq r \leq n$
174174

175175
**@{keyword.complexity}**

document_ja/lazysegtree.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -138,12 +138,12 @@ S seg.all_prod()
138138
- `r = l` もしくは `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`
139139
- `r = n` もしくは `g(op(a[l], a[l + 1], ..., a[r])) = false`
140140

141-
`f`が単調だとすれば、`g(op(a[l], a[l + 1], ..., a[r - 1])) = true` となる最大の `r`、と解釈することが可能です。
141+
`g`が単調だとすれば、`g(op(a[l], a[l + 1], ..., a[r - 1])) = true` となる最大の `r`、と解釈することが可能です。
142142

143143
**@{keyword.constraints}**
144144

145-
- `f`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
146-
- `f(e_s()) = true`
145+
- `g`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
146+
- `g(e()) = true`
147147
- $0 \leq l \leq n$
148148

149149
**@{keyword.complexity}**
@@ -165,12 +165,12 @@ S seg.all_prod()
165165
- `l = r` もしくは `g(op(a[l], a[l + 1], ..., a[r - 1])) = true`
166166
- `l = 0` もしくは `g(op(a[l - 1], a[l], ..., a[r - 1])) = false`
167167

168-
`f`が単調だとすれば、`g(op(a[l], a[l + 1], ..., a[r - 1])) = true` となる最小の `l`、と解釈することが可能です。
168+
`g`が単調だとすれば、`g(op(a[l], a[l + 1], ..., a[r - 1])) = true` となる最小の `l`、と解釈することが可能です。
169169

170170
**@{keyword.constraints}**
171171

172-
- `f`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
173-
- `f(e_s()) = true`
172+
- `g`を同じ引数で呼んだ時、返り値は等しい(=副作用はない)
173+
- `g(e()) = true`
174174
- $0 \leq r \leq n$
175175

176176
**@{keyword.complexity}**

0 commit comments

Comments
 (0)