PAT A1008：Elevator

题目描述

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

代码(AC)

#include
#include
using namespace std;
int main()
{int n;scanf("%d",&n);int a[n];int count=0;for(int i=0;i<n;i++)scanf("%d",&a[i]);count=6*a[0]+5;for(int i=1;i<n;i++){count+=(a[i]>a[i-1]?6:4)*abs(a[i]-a[i-1])+5;	}	printf("%d",count);return 0;
} 

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！