PAT甲级 1008 Elevator

PAT甲级 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.

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

题目分析

本题为电梯问题，要求给出电梯将要停的层数，并告知上升一层需6s，下降一层需4s，每层停留5s，问共需要的时间，开始从0层计算。

输入格式：
停下层数总数N 层数1、层数2…层数N

输出格式：
共需要的时间

解决方法：

一个简单的分条件求和问题

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

处理结果：