PAT (Advanced Level) Practice A1008 Elevator (20 分)(C++) (甲级) (小学数学题……)

版权声明:假装有个原创声明……虽然少许博文不属于完全原创,但也是自己辛辛苦苦总结的,转载请注明出处,感谢! https://blog.csdn.net/m0_37454852/article/details/86579106

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

using namespace std;
#include<algorithm>
#include<iostream>
#include<cstdio>

int main()
{
    int N, time, now, last = 0;//原本在第0层
    scanf("%d", &N);
    time = N*5;//停留时间之和
    for(int i=0; i<N; i++)
    {
        scanf("%d", &now);//现在所在楼层
        if(now-last > 0) time += (now-last)*6;//本次上升所需时间
        else time += (last-now)*4;//本次下降所需时间
        last = now;
    }
    printf("%d", time);
	return 0;
}

猜你喜欢

转载自blog.csdn.net/m0_37454852/article/details/86579106