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

题目大意：电梯从0层开始向上，给出该电梯依次按顺序停的楼层，上升需要6秒/层，下降需要4秒/层，每到一层需要停留5秒，问走完所有楼层后总共花了多少时间。

分析：令 t 为当前楼层，a表示将要去的层数，a > t 时，电梯上升，需要 6 * (a – t) 秒，当a < t 时，电梯下降，需要 4 * (t – a) 秒，每到一个楼层需要停 5 秒，最后输出累加的结果 ans 即可。

#include   <cstdio>
#include    <ctime>

int main(void)
{
    #ifdef test
    freopen("in.txt","r",stdin);
    //freopen("in.txt","w",stdout);
    clock_t start=clock();
    #endif //test

    int n,t=0,ans=0;
    scanf("%d",&n);
    for(int i=0;i<n;++i)
    {
        int a;scanf("%d",&a);
        if(a>t)ans+=(a-t)*6+5;
        else ans+=(t-a)*4+5;
        t=a;
    }
    printf("%d\n",ans);

    #ifdef test
    clockid_t end=clock();
    double endtime=(double)(end-start)/CLOCKS_PER_SEC;
    printf("\n\n\n\n\n");
    cout<<"Total time:"<<endtime<<"s"<<endl;        //s为单位
    cout<<"Total time:"<<endtime*1000<<"ms"<<endl;    //ms为单位
    #endif //test
    return 0;
}