PTA 甲级 1008 Elevator (20 分)

题目

有一个电梯，现在你在第0 层，给你一个纸条。N是指令的数目，接下来N个是电梯要依次到达的层数。

已知电梯上升需要6秒， 下降需要4秒， 停在某一层需要5秒。

完成所有的指令一共需要多少秒

he 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

分析

应该是没有难度的题目，就是模拟就好了。

依稀感觉好像做过这道题。

代码

int N;
const int maxn = 10005;
int note[maxn];

int main()
{
    memset(note , 0 , sizeof(note));
    cin >> N;
    for(int i = 0; i < N ; i++)
        cin >> note[i];

    int cur = 0;
    int ans = 0;
    int up = 6 , down = 4 , stay = 5;
    for(int i = 0 ; i < N ;i++)
    {
       int tmp = note[i] - cur  ;
       if( tmp < 0 ) ans += (- tmp) * down;
       if( tmp > 0 ) ans += tmp * up;
       ans += stay;
       cur = note[i];
      
    }
   
    cout << ans ;

}