该博客介绍了PAT甲级考试中的一道题目——1008 Elevator。题目要求计算电梯根据给定楼层请求停靠所需的时间，其中上一层6秒，下一层4秒，每停一次5秒。博客提供了输入输出规格、样例输入输出，并解析了题意，指出需要注意相邻楼层相同的情况。最后，给出了实现代码。
1008 Elevator （20 分）
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.
Input Specification:
Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.
Output Specification:
For each test case, print the total time o
最低0.47元/天 解锁文章
472
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
