1008. Elevator

最新推荐文章于 2022-08-15 17:40:51 发布

无知的渣渣

最新推荐文章于 2022-08-15 17:40:51 发布

阅读量287

点赞数

分类专栏： PAT（甲级）文章标签： PAT c语言

本文链接：https://blog.csdn.net/dengkuomin/article/details/69944452

版权

PAT（甲级）专栏收录该内容

8 篇文章 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:

解题思路：题目大意就是电梯从开始到最后一个人出了电梯之后运行了多久的时间，上一层是6秒，停一次是5秒，下一层是4秒，求最后的时间。。。

代码如下：

#include <bits/stdc++.h>
int main()
{
  int n,a,t=0,s=0;
  scanf("%d",&n);
  for(int i=0;i<n;i++)
  {
    scanf("%d",&a);
    if(a>t) s+=6*(a-t);///上
    else s+=4*(t-a);///下
    s+=5;///停留时间
    t=a;
  }
  printf("%d\n",s);
  return 0;
}