Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1008. Elevator

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



#include <cstdio>

int main()
	int n; scanf("%d", &n);

	int ans = 0, pre = 0, t;
	while (n--)
		scanf("%d", &t), ans += t>=pre ? (t-pre)*6+5 : (pre-t)*4+5, pre = t;

	printf("%d\n", ans);
	return 0;
上一篇: 下一篇: