From 97f4d544d9ad0b80edd44d248867213250700240 Mon Sep 17 00:00:00 2001
From: Martin Kagamino Lehoux <martin@lehoux.net>
Date: Sun, 28 Jul 2024 18:38:09 +0200
Subject: fix: One more iteration to find the best climb

---
 ride/climb.go | 7 +++++++
 1 file changed, 7 insertions(+)

(limited to 'ride/climb.go')

diff --git a/ride/climb.go b/ride/climb.go
index 3b3d6dc..cff2b39 100644
--- a/ride/climb.go
+++ b/ride/climb.go
@@ -79,6 +79,13 @@ func bestClimbBetween(points []Point, start int, end int) Climb {
 			bestScore = score
 		}
 	}
+	for i := bestStart; i < bestEnd; i++ {
+		score := Score(points, i, bestEnd)
+		if score > bestScore {
+			bestStart = i
+			bestScore = score
+		}
+	}
 	climb := Climb{bestStart, bestEnd}
 
 	kcore.Assert(climb.start < climb.end, "empty climb")
-- 
cgit v1.2.3