杭电 ACM 1008 Elevator

SimonHu-real

于 2017-04-23 18:18:01 发布

阅读量477

点赞数

分类专栏：修炼之路文章标签：个人学习笔记 ACM 个人记录

本文链接：https://blog.csdn.net/hsm159/article/details/70537166

版权

修炼之路专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Elevator

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 71382 Accepted Submission(s): 39215

Problem Description

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

There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.

Output

Print the total time on a single line for each test case.

Sample Input

Sample Output

Author

ZHENG, Jianqiang

Source

ZJCPC2004

Recommend

JGShining | We have carefully selected several similar problems for you: 1002 1009 1021 1108 1019

#include<iostream>
#include<string>
using namespace std;
int main(void)
{
	int evl;
	int pre = 0;
	int up, down, stay;
	up = 6; down = 4; stay = 5;
	int sum = 0;
	int n;
	char c;
	while (1)
	{
		cin >> n;
		if (0 == n) break;
		else
		{
			for (int i = 0; i < n; i++)
			{
				cin >> evl;
				if (evl > pre)
				{
					sum += ((evl - pre)*up);
				}
				else
				{
					sum += ((pre - evl)*down);
				}
				pre = evl;
				sum += 5;//停一次就加5，
			}
		}
		cout << sum << endl;
		sum = 0;
		pre = 0;
	}
}

巨坑，没看到每一行前面的那个N是接下来要输入的楼层的个数，搞的算了半天都不对

在思考中也犯了一个错误，把等待时间理解成了，每次经过一个楼层都要等待，但实际情况是只有到达目标楼层才会停一次

（每层都停说不定坐电梯还没爬楼梯快 O__O "…）