PAT 甲级1008 Elevator （20 分)

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 on a single line.

Sample Input:

3 2 3 1

Sample Output:

41

 

题目大意：

  给定k个数字，数字表示用户要到的楼层，由此模拟电梯运行：一开始电梯停在第0层， 如果电梯向上运行则每升高一层楼都将花费6 s，而向下运行每下降一层楼会花费4 s，且每次到了用户指定的层数，电梯都会停留5 s。最后电梯不用回到第0层。请输出总共花费的时间。

  注意如果当前电梯在第i层，且用户刚好就要去第i层，仍然需要停留5 s。

 

思路：

  因为有n 个请求将会停留n次，则总时间ans 初始化 n * 5。然后读入请求列表，判断当前楼层和下一个要去的楼层，如果要上升电梯则相应的 ans += 6 * （next - now）。否则 ans += 4 * (now – next)。

 

参考代码：

#include<cstdio>
int n, ans, now, next;
int main(){
	scanf("%d", &n);
	ans = n * 5; 
	for(int i = 0; i < n; ++i){
		scanf("%d", &next);
		if(next > now)	ans += 6 * (next - now);
		else	ans += 4 * (now - next);
		now = next;
	}
	printf("%d", ans);
	return 0;
}