pat甲级1008. Elevator (20)

最新推荐文章于 2022-12-03 14:57:10 发布

active2489595970

最新推荐文章于 2022-12-03 14:57:10 发布

阅读量235

点赞数 1

分类专栏： pat甲级解题报告

本文链接：https://blog.csdn.net/active2489595970/article/details/69787414

版权

pat甲级解题报告专栏收录该内容

12 篇文章 0 订阅

订阅专栏

1008. Elevator (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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:

题意分析：

输入一个数n，随后输入n个数，代表楼层，电梯往上需要6s,往下需要4s,每一层停留5s，输出总时间，直接上代码

AC参考代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string.h>
#include<cstdio>
#include<stdio.h>
using namespace std;
int main()
{
        int n;
        while(scanf("%d",&n)!=EOF)
        {
                int temp;
                int ans=0;
                int sum=0;
                for(int i=1;i<=n;i++)
                {
                        scanf("%d",&temp);
                        if(temp>ans)
                        {
                                sum+=(temp-ans)*6;
                        }
                        else if(temp<ans)
                        {
                                sum+=(ans-temp)*4;
                        }
                        ans=temp;
                        sum+=5;
                }
                printf("%d\n",sum);
        }
        return 0;
}