关闭

1008. Elevator (20)

76人阅读 评论(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:
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;
}


0
0

猜你在找
【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐(算法+实战)--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:52765次
    • 积分:1392
    • 等级:
    • 排名:千里之外
    • 原创:77篇
    • 转载:84篇
    • 译文:0篇
    • 评论:4条
    最新评论