hdu 1008 Elevator

问题描述：

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.

我们城市最高的建筑只有一部电梯。请求列表由N个正数组成。数字表示电梯将以指定的顺序停在哪些楼层。将电梯向上移动一层需要6秒钟，向下移动一层楼需要4秒钟。电梯将在每个站点停留5秒钟。
对于给定的请求列表，您将计算在列表上完成请求所花费的总时间。电梯在开始时位于0楼，并且在满足要求时不必返回到底层。

输入：

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.

有多个测试用例。每个案例包含一个正整数N，后跟N个正数。输入中的所有数字都小于100. N = 0的测试用例表示输入结束。不处理此测试用例。

输出：

Print the total time on a single line for each test case. 

为每个测试用例打印花费的时间，分别占用一行。 

---

AC代码 运行时间0MS 运行内存1692K

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
    int N,time;//N存储总停留的层数，time总停留的时间
    int start,end;//start开始层，end结束层
    int i,num;
    while(scanf("%d", &N) != EOF)
    {
        if(N == 0) break;//结束测试条件
        time = 0;//初始化时间
        start = 0;//电梯从0层开始
        for(i = 0;i < N;i++)
        {
            scanf("%d",&end);//输入依次需要停留的楼层
            num = end-start;
            if(num >0)
                time += num*6;//上升num层，上升一层时间为6秒
            else
                time += abs(num)*4;//下降num层，下降一层时间为4秒
            start = end; //重新记录开始层
        }
        time += N*5;//每层停留时间为5秒
        printf("%d\n",time);
    }
    return 0;
}