A1008 Elevator (20分)【C语言】

最新推荐文章于 2021-01-29 12:12:49 发布

SASAKI_130

最新推荐文章于 2021-01-29 12:12:49 发布

阅读量1.6k

点赞数

本文链接：https://blog.youkuaiyun.com/SASAKI_130/article/details/107163624

版权

这是一个关于解决城市最高建筑电梯问题的C语言程序。给定一个包含电梯停靠楼层的请求列表，需要计算完成所有请求所需的时间。电梯初始位于0层，上楼每层耗时6秒，下楼每层4秒，每停靠一层停留5秒。程序输入为请求列表的长度及各楼层数值，输出为总耗时。例如，对于输入样例`3 2 3 1`，输出为41秒。

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

A1008 Elevator (20分)【C语言】

原题链接

to记录要去的楼层，now记录当前所处楼层，根据to和now的大小关系判断上楼、下楼还是停留在当前楼层（不需要上下楼时间，但要计算停留时间）。

题目描述：
The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.

For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.

输入格式：
Each input file contains one test case. Ea