Elevator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34175 Accepted Submission(s): 18612
Problem Description
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.
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
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
Output
Print the total time on a single line for each test case.
Sample Input
1 2 3 2 3 1 0
Sample Output
17 41作为一个英语渣渣和新手 成功的被这个题目坑了 原来题意是说每到一个楼层才停 并不是每层都停 知道了这个就很好算了 最好一层也是停的#include <stdio.h> #include <iostream> using namespace std; int main() { int floor,temp,sum1,i,t; while (scanf("%d",&t)) { if (t==0) break; sum1=0; scanf("%d",&floor); temp=floor; sum1=floor*6+5; for (i=1;i<t;i++) { scanf("%d",&floor); if (floor>temp) sum1+=(floor-temp)*6+5; else sum1+=(temp-floor)*4+5; temp=floor; } printf("%d\n",sum1); } return 0; }