即日起在codingBlog上分享您的技术经验即可获得积分,积分可兑换现金哦。

1008. Elevator (20)

编程语言 Star1996 17℃ 0评论
本文目录
[隐藏]

1. 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:

41


/*
输入:N表示接下来有N个数。。。。
输出:总的用时
感觉还是比较简单的,一开始电梯在0层,接下来每一次移动后要停5秒,上升一层费时6秒,下降一层费时4秒
我还以为数据都跑完后要回到一楼,结果好像是我想多了。 
*/
#include
using namespace std;
int main()
{
 int N;
 int a=0;
 int time=0;
 cin>>N;
 while(N--)
 {
  int b;
  cin>>b;
  if(b>a)
  {
   time=time+(b-a)*6+5;
  }
  else if(b





转载请注明:CodingBlog » 1008. Elevator (20)

喜欢 (0)or分享 (0)
发表我的评论
取消评论

*

表情