PAT A1008

• 题目：
  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层，上一层楼需要6s，下一层楼需要4s,每次到达当前目的楼层还需停留5s，现给出电梯要去的楼层的顺序，求总共需要花费的时间
• 分析：
  累加计算输出～now表示现在的层数，a表示将要去的层数，当a > now，电梯上升，需要6 * (a – now)秒，当a < now，电梯下降，需要4 * (now – a)秒，每一次需要停5秒，最后输出累加的结果sum～

代码实现：

#include <iostream>
using namespace std;
int main()
{
    int n, a, res = 0, now = 0;
    cin >> n;
    for(int i = 0; i < n; i++){
        cin >> a;
        if(a > now)
            res = res + (6 * (a - now));
        else
            res = res + (4 * (now - a));
        now = a;
    }
    res += 5*n;
    cout << res;
    return 0;
}