@@ -161,4 +161,4 @@ $O(\log n)$
 
 ## 使用例
 
-[AtCoder Library Practice Contest K-Range Affine Range Sum](https://atcoder.jp/contests/practice2/submissions/16646083)
+[AtCoder Library Practice Contest K - Range Affine Range Sum](https://atcoder.jp/contests/practice2/submissions/16646083)
@@ -131,3 +131,7 @@ public void changeEdge(int i, long newCap, long newFlow)
 計算量
 
 $O(1)
+
+## 使用例
+
+[AtCoder Library Practice Contest D - Maxflow](https://atcoder.jp/contests/practice2/submissions/16646346)
@@ -128,3 +128,7 @@ fが単調だとすれば、`f(op(a[l], a[l + 1], ..., a[r - 1])) = true` とな
 計算量
 
 $O(\log n)$
+
+## 使用例
+
+[AtCoder Library Practice Contest J - Segment Tree](https://atcoder.jp/contests/practice2/submissions/16646450)
Original file line number	Diff line number	Diff line change
`@@ -161,4 +161,4 @@ $O(\log n)$`
`161`	`161`
`162`	`162`	`## 使用例`
`163`	`163`
`164`		`-[AtCoder Library Practice Contest K-Range Affine Range Sum](https://atcoder.jp/contests/practice2/submissions/16646083)`
	`164`	`+[AtCoder Library Practice Contest K - Range Affine Range Sum](https://atcoder.jp/contests/practice2/submissions/16646083)`