@@ -3,6 +3,7 @@
  * 
  * @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
  */
+
 class LazySegTree<S, F> {
     final int MAX;
 
@@ -166,7 +167,7 @@ public void apply(int l, int r, F f) {
 
     public int maxRight(int l, java.util.function.Predicate<S> g) {
         inclusiveRangeCheck(l);
-        if (!f.test(E)) {
+        if (!g.test(E)) {
             throw new IllegalArgumentException("Identity element must satisfy the condition.");
         }
         if (l == MAX) return MAX;
@@ -194,7 +195,7 @@ public int maxRight(int l, java.util.function.Predicate<S> g) {
 
     public int minLeft(int r, java.util.function.Predicate<S> g) {
         inclusiveRangeCheck(r);
-        if (!f.test(E)) {
+        if (!g.test(E)) {
             throw new IllegalArgumentException("Identity element must satisfy the condition.");
         }
         if (r == 0) return 0;
 
@@ -158,3 +158,7 @@ fが単調だとすれば、`f(op(a[l], a[l + 1], ..., a[r - 1])) = true` とな
 計算量
 
 $O(\log n)$
+
+## 使用例
+
+[AtCoder Library Practice Contest K-Range Affine Range Sum](https://atcoder.jp/contests/practice2/submissions/16646083)