✨ feat(LiChaoTreeDynamicPersistent):

Author: liaomingtian

10_分治法/李超线段树/LiChaoDynamic.go

@@ -128,13 +128,13 @@ type queryPair = struct {
 }
 
 type LiChaoTree struct {
-	n, offset     int
-	lower, higher int
-	compress      bool
-	minimize      bool
-	xs            []int
-	lines         []Line
-	lineIds       []int
+	n, offset  int
+	start, end int
+	compress   bool
+	minimize   bool
+	xs         []int
+	lines      []Line
+	lineIds    []int
 }
 
 // 指定查询的 x 值建立李超线段树，采用坐标压缩.
@@ -167,9 +167,10 @@ func NewLiChaoTreeCompress(queryX []int, minimize bool) *LiChaoTree {
 }
 
 // 指定查询的 x 值范围建立李超线段树，不采用坐标压缩.
-// higher - lower <= 1e6.
-func NewLiChaoTreeNoCompress(lower, higher int, minimize bool) *LiChaoTree {
-	n := higher - lower
+// end - start <= 1e6.
+func NewLiChaoTreeNoCompress(start, end int, minimize bool) *LiChaoTree {
+	end++
+	n := end - start
 	log := 1
 	for (1 << log) < n {
 		log++
@@ -181,7 +182,7 @@ func NewLiChaoTreeNoCompress(lower, higher int, minimize bool) *LiChaoTree {
 	}
 	return &LiChaoTree{
 		n: n, offset: offset,
-		lower: lower, higher: higher,
+		start: start, end: end,
 		compress: false, minimize: minimize,
 		lineIds: lineIds,
 	}
@@ -315,7 +316,7 @@ func (tree *LiChaoTree) _evaluateInner(fid int, x int) T {
 	if tree.compress {
 		target = tree.xs[min(x, tree.n-1)]
 	} else {
-		target = x + tree.lower
+		target = x + tree.start
 	}
 	return Evaluate(tree.lines[fid], target)
 }
@@ -324,10 +325,10 @@ func (tree *LiChaoTree) _getIndex(x int) int {
 	if tree.compress {
 		return sort.SearchInts(tree.xs, x)
 	}
-	if x < tree.lower || x > tree.higher {
+	if x < tree.start || x > tree.end {
 		panic("x out of range")
 	}
-	return x - tree.lower
+	return x - tree.start
 }
 
 func min(a, b int) int {

10_分治法/李超线段树/LiChao.go renamed to 10_分治法/李超线段树/LiChaoTree.go

@@ -11,8 +11,8 @@ const INF = 2e9 // 2e15
 class LiChaoTree {
   private readonly _n: number
   private readonly _offset: number
-  private readonly _lower: number
-  private readonly _higher: number
+  private readonly _start: number
+  private readonly _end: number
   private readonly _compress: boolean
   private readonly _minimize: boolean
   private readonly _lineIds: Int32Array
@@ -33,11 +33,11 @@ class LiChaoTree {
 
   /**
    * 指定查询的 x 值范围建立李超线段树，不采用坐标压缩.
-   * higher - lower <= 1e6.
+   * end - start <= 1e6.
    */
   constructor(
-    lower: number,
-    higher: number,
+    start: number,
+    end: number,
     options?: {
       minimize?: boolean
       evaluate?: (line: Line, x: number) => number
@@ -56,8 +56,8 @@ class LiChaoTree {
       const lineIds = new Int32Array(offset << 1).fill(-1)
       this._n = n
       this._offset = offset
-      this._lower = 0
-      this._higher = 0
+      this._start = 0
+      this._end = 0
       this._compress = true
       this._minimize = minimize
       this._lineIds = lineIds
@@ -66,15 +66,16 @@ class LiChaoTree {
       this._evaluate = evaluate
     } else {
       const { minimize = true, evaluate = (line: Line, x: number) => line.k * x + line.b } = arg3 || {}
+      arg2++
       const n = arg2 - arg1
       let log = 1
       while (1 << log < n) log++
       const offset = 1 << log
       const lineIds = new Int32Array(offset << 1).fill(-1)
       this._n = n
       this._offset = offset
-      this._lower = arg1
-      this._higher = arg2
+      this._start = arg1
+      this._end = arg2
       this._compress = false
       this._minimize = minimize
       this._lineIds = lineIds
@@ -172,14 +173,14 @@ class LiChaoTree {
 
   private _evaluateInner(fid: number, x: number): number {
     if (fid === -1) return this._minimize ? INF : -INF
-    const target = this._compress ? this._xs[Math.min(x, this._n - 1)] : x + this._lower
+    const target = this._compress ? this._xs[Math.min(x, this._n - 1)] : x + this._start
     return this._evaluate(this._lines[fid], target)
   }
 
   private _getIndex(x: number): number {
     if (this._compress) return LiChaoTree._lowerBound(this._xs, x)
-    if (x < this._lower || x > this._higher) throw new RangeError(`x out of range: ${x}`)
-    return x - this._lower
+    if (x < this._start || x > this._end) throw new RangeError(`x out of range: ${x}`)
+    return x - this._start
   }
 
   private static _lowerBound(arr: ArrayLike<number>, x: number): number {
@@ -239,7 +240,7 @@ if (require.main === module) {
     const points = Array(q)
       .fill(0)
       .map(() => Math.floor(-Math.random() * 1e5) + 5e4)
-    const tree1 = new LiChaoTree(points, { minimize: false })
+    const tree1 = new LiChaoTree(-1e5, 1e5, { minimize: false })
     const tree2 = new Mocker(false)
     for (let i = 0; i < q; i++) {
       const k = -Math.floor(Math.random() * 1e5) + 5e4