A Walk Through the Forest(最短路径+深搜)

最新推荐文章于 2019-11-01 20:32:32 发布

原创

最新推荐文章于 2019-11-01 20:32:32 发布 · 1.6k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#dijkstra算法 #最短路径 #hdu1142 #toj1538

本文介绍了Jimmy在工作压力下通过森林散步放松的故事，他的目标是每天选择一条不同的路线回家，并确保每次都能朝着家的方向前进。文章讨论了如何计算Jimmy在森林中可能的不同行走路线数量，涉及最短路径问题。样例输入和输出展示了具体的路径和数量。注意，题目要求并不简单寻找最短路径，而是基于路径对终点距离的影响来确定可行的路线数量。

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

描述：

Jimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even nicer, his office is on one side of a forest, and his house is on the other. A nice walk through the forest, seeing the birds and chipmunks is quite enjoyable.
The forest is beautiful, and Jimmy wants to take a different route everyday. He also wants to get home before dark, so he always takes a path to make progress towards his house. He considers taking a path from A to B to be progress if there exists a route from B to his home that is shorter than any possible route from A. Calculate how many different routes through the forest Jimmy might take.