每一行走完线段后,直接从线段的左或右端点向下走,记录每行左右走至线段端点的最小开销,最后得出总的最小开销。
# 获取从 start 开始到 left 和 right 的开销,cost 是 start 的开销。
def getCost(start, left, right, cost):
segment = right - left
# 根据 start 的位置分为:线段左侧,线段右侧,线段中
if start <= left:
tr = right - start
tl = tr + segment
elif start >= right:
tl = start - left
tr = tl + segment
else:
tl = right - start + segment
tr = start - left + segment
return tl + cost, tr + cost
def main():
n = int(input())
nums = [list(map(int, input().split())) for _ in range(n)]
# 左右端点位置,到达左右端点的开销
left, right, toLeft, toRight = 1, 1, 0, 0
for i in range(n):
l1, r1 = getCost(left, nums[i][0], nums[i][1], toLeft)
l2, r2 = getCost(right, nums[i][0], nums[i][1], toRight)
toLeft = min(l1, l2)
toRight = min(r1, r2)
left, right = nums[i][0], nums[i][1]
# 最后一行端点到 (n, n)的最小开销,及之前每次向下走的开销。
res = min(toLeft + n - left, toRight + n - right) + n - 1
print(res)