[HDU ACM] 1008 Elevator

Elevator

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 60465    Accepted Submission(s): 33173

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.

 

 

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

 

 

输入:

连续输入多行，第一个正整数表示一共电梯到达多少层，也就是后续输入正整数的个数，求电梯运行花费的时间

电梯上升一层花费是6秒，下降一层用时4秒，升降停顿时间是5秒。

 

 

 1 #include<iostream>
 2 
 3 using namespace std;
 4 void main(){
 5     int num;
 6     while(cin>>num){
 7         if(num1==0){
 8             break;
 9         }
10         int p=0,l=0,sum=0;
11         for(int i=0;i<num;i++){
12             cin>>l;
13             if(l>=p){
14                 sum+=(l-p)*6+5;
15                 p=l;}
16             else
17                 sum+=(p-l)*4+5;
18                 p=l;
19         }
20         cout<<sum<<endl;
21     }
22 }    

 

转载于:https://www.cnblogs.com/qyping/p/5326254.html