JZOJ2133.2017.05.20【usaco2017_Mar Bronze & Silver】C组T1The Lost Cow

路人黑的纸巾

于 2017-05-20 16:16:06 发布

阅读量1.3k

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟赛 usaco 文章标签：模拟赛 usaco

本文链接：https://blog.csdn.net/enjoy_pascal/article/details/72580342

农民约翰在寻找丢失的奶牛Bessie，他在一条直线上来回移动，采用'Z'模式搜索策略。根据算法，他至少需要行走9次直接距离才能找到Bessie。题目要求计算按此策略行走的总距离。给定起点和终点坐标，程序需要模拟这一过程并输出总距离。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

    Farmer John has lost his prize cow Bessie, and he needs to find her!
   Fortunately, there is only one long path running across the farm, and Farmer John knows that Bessie has to be at some location on this path. If we think of the path as a number line, then Farmer John is currently at position xand Bessie is currently at position y (unknown to Farmer John). If Farmer John only knew where Bessie was located, he could walk directly to her, traveling a distance of |x−y|. Unfortunately, it is dark outside and Farmer John can't see anything. The only way he can find Bessie is to walk back and forth until he eventually reaches her position.

   Trying to figure out the best strategy for walking back and forth in his search, Farmer John consults the computer science research literature and is somewhat amused to find that this exact problem has not only been studied by computer scientists in the past, but that it is actually called the "Lost Cow Problem

最低0.47元/天解锁文章