1008. Elevator (20)

時間限制 400 ms
內存限制 65536 kB
代碼長度限制 16000 B
判題程序 Standard 作者 CHEN, Yue

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
/*************************************************************************> File Name: 1008.c> Author: YueBo> Mail: yuebowhu@163.com> Created Time: Sun 14 May 2017 08:15:38 AM CST************************************************************************/#include<stdio.h> #define UPTIME 6 #define DOWNTIME 4 #define STAYTIME 5int main() {int N, crnt_floor = 0, lst_floor = 0;int loopi;int diff;int sum = 0;scanf("%d", &N);for (loopi = 0; loopi < N; loopi++){scanf("%d", &crnt_floor);diff = crnt_floor - lst_floor;if (diff > 0)sum += UPTIME * diff; elsesum += DOWNTIME * diff * (-1);sum += STAYTIME;lst_floor = crnt_floor;}printf("%d\n", sum);return 0; }

總結

以上是生活随笔為你收集整理的1008. Elevator (20)的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。