ACM-BFS之A strange lift——hdu1548

最新推荐文章于 2021-12-18 21:01:38 发布

ltree98

最新推荐文章于 2021-12-18 21:01:38 发布

阅读量1.7k

点赞数

分类专栏： ACM-搜索漫漫刷题路文章标签： ACM BFS A strange lift hdu1548

本文链接：https://blog.csdn.net/lttree/article/details/22927131

版权

本文介绍了ACM中使用BFS解决一个关于奇特电梯的题目。电梯有两个按钮UP和DOWN，按下后会到达特定楼层。讨论了如何计算从一层到另一层所需的步数，并说明了遇到无效楼层时的情况。该问题通过广度优先搜索算法轻松解决。

摘要由CSDN通过智能技术生成

A strange lift
题目： http://acm.hdu.edu.cn/showproblem.php?pid=1548
Problem Description
There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When you at floor i,if you press the button "UP" , you will go up Ki floor,i.e,you will go to the i+Ki th floor,as the same, if you press the button "DOWN" , you will go down Ki floor,i.e,you will go to the i-Ki th floor. Of course, the lift can't go up high than N,and can't go down lower than 1. For example, there is a buliding with 5 floors, and k1 = 3, k2 = 3,k3 = 1,k4 = 2, k5 = 5.Begining from the 1 st floor,you can press the button "UP",