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

题目大意：

我们城市最高的建筑物只有一个电梯。一个请求列表由N个正整数组成。在指定的顺序中，数字表示电梯将停在那个楼层。将电梯向上移动一层需要6秒的时间，向下移动一层需要4秒电梯将在每一站停留5秒。
对于给定的请求列表，你需要计算满足表上请求的总时间。电梯开始时在第0层，当完成要求时不需要返回地面。
输入规格：
每个输入文件包含一个测试用例。每个里走都包含一个正整数N，后面紧跟着N个正整数。输入的所有数都小于100.
输出规范：
对于每个测试用例，将总时间打印在一行上。

代码：

#include<stdio.h>
int main()
{
    int i,j,n,m,k=0,t,sum=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&m);
            if(m>k)
            {
                sum+=(m-k)*6;
            }
            else
            {
                sum+=(k-m)*4;
            }
            k=m;
            sum+=5;
    }
    printf("%d",sum);
    return 0;
}