HBC25080A题是个签到题[USACO 2007 Ope S]Catch That Cow题解 (farmerjohn)

回忆凄美了谁 算法基础篇 48 0
想要成为编程高手?那就来试试全网最全C++题库,让您在练习中快速成长。
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 <= N <= 100,000) on a number line and the cow is at a point K (0 <= K <= 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting. Walking: FJ can move from any point X to the points X-1 or X+1 in a single minute Teleporting: FJ can move from any point X to the point 2*X in a single minute. If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

HBC25080A题是个签到题[USACO 2007 Ope S]Catch That Cow题解
(farmerjohn)-第1张图片-东莞河马信息技术
(图片来源网络,侵删)

标签: HBC25080A题是个签到题[USACO 2007 Ope S]Catch That Cow题解