课程练习一 Problem G id:1006

*1.题目编号：课程练习一  Problem G   id:1006

*简单题意：求电梯升降及等待的时间总和

*解题思路：时间可以分成电梯升，降，等待的时间，其中，等待的时间是5*N,即在电梯;而要判断上升，下降，只需将数组全部初始化为0，对数组的第一位到第N位赋值，通过for循环比较第i位与i+1位的大小即可判断。

*感想  ：做简单题果然没有成就感。。。

*AC代码

 # include<iostream>
 # include<string.h>
using namespace std;
int main()
{
    int N,i,a[101];

    while(cin>>N&&N)
    {
            memset(a,0,101);
        int move=0;
        for( i=1;i<=N;i++)
        {
            cin>>a[i];    
        }
        move=N*5;
        for(i=0;i<N;i++)
        {
                if(a[i+1]>=a[i])
                {
                    move+=(a[i+1]-a[i])*6;
                }
                else
                {
                        move+=(a[i]-a[i+1])*4;
                }
            
        }
        cout<<move<<endl;
    }
    return 0;
}

Problem G

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 91   Accepted Submission(s) : 57

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

   
   

 

Statistic  |   Submit  |   Back