点点滴滴

发现不足,弥补不足,持续的努力~

1008. Elevator (20)

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
#include<vector>
#include <sstream>
#include<cmath>
#include<iomanip>
#include<iostream>
#include <ctype.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;
//1008. Elevator (20)
int main()
{
	int n;
	cin >> n;
	int nums[10000] = { 0 };
	for (int i = 0; i < n; i++)
	{
		cin >> nums[i];
	}
	int mintues = nums[0] * 6 + 5;//从最底层到第一个数对应的层数
	for (int i = 1; i < n; i++)
	{
		int minus = nums[i] - nums[i - 1];//计算差值,通过正负判断电梯是往上还是往下
		if (minus>0)
		{
			mintues += minus * 6 + 5;
		}
		else
		{
			mintues += abs(minus) * 4 + 5;
		}
	}
	cout << mintues;
	return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/fynjy/article/details/46779197
个人分类: Advanced PAT C++
上一篇1005. Spell It Right (20)
下一篇1011. World Cup Betting (20)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭