POJ - 2387：Til the Cows Come Home

最新推荐文章于 2020-11-06 21:35:09 发布

wingrez

最新推荐文章于 2020-11-06 21:35:09 发布

阅读量243

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/90085489

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

博客介绍了如何解决POJ中的2387题，即在一个包含N个地标和T条双向牛道的农场中，让奶牛Bessie从苹果树丛返回谷仓的最短路径问题。通过Dijkstra算法，可以找到从地标N到地标1的最小行走距离。博客提供输入输出样例，并解释了样例细节，以及题目的大致意思。

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

Til the Cows Come Home

来源：POJ

标签：最短路径问题，Dijkstra算法

参考资料：

相似题目：

题目

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John’s field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1…N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation a

了解本专栏