HDOJ 1008 Elevator
来源:互联网 发布:数据挖掘商业模型 编辑:程序博客网 时间:2024/05/22 06:59
Elevator
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.
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
1 23 2 3 10
Sample Output
1741
这个题有个坑,就是必须按照它给的顺序下电梯,比如2,3,1. 得先到2层,再到3层,再到1层
还有一个坑就是同层到同层,如2到2,也得停留5秒,以下是代码:
#include<stdio.h>
int main()
{
int n,i,a[105];
while(scanf("%d",&n)&n!=0)
{
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
int sum=0;
a[0]=0;
for(i=1;i<=n;i++)
{
if(a[i]>a[i-1]) sum+=6*(a[i]-a[i-1])+5;
if(a[i]==a[i-1]) sum+=5; //此处是同层的情况,注意了~~
if(a[i]<a[i-1]) sum+=4*(a[i-1]-a[i])+5;
}
printf("%d\n",sum);
}
return 0;
}
0 0
- HDOJ 1008: Elevator
- HDOJ--1008 Elevator
- HDOJ 1008 Elevator
- HDOJ-1008 Elevator
- HDOJ 1008 Elevator
- hdoj.1008 Elevator 20140728
- HDOJ 1008 Elevator
- 【HDOJ】【1008】Elevator
- HDOJ 1008-Elevator【数学】
- HDOJ 1008 Elevator
- HDOJ 1008 Elevator
- HDOJ 1008 Elevator
- HDOJ 1008 Elevator
- HDOJ 1008 Elevator
- HDOJ 1008 Elevator
- hdoj 1008 elevator
- HDOJ 1008 Elevator解题报告
- [HDOJ 1008] Elevator (模拟题)
- 设计模式之六大基本原则
- 50题(ACM学习推荐题)
- Hadoop集群(第5期)_Hadoop安装配置
- linux命令dd
- ubunut下C编程
- HDOJ 1008 Elevator
- exit和return的区别
- POJ 3060Phone List
- cocos2dx 3.1 实现简单的截屏
- PHP:PHP5内置数组和常量
- Linux程序编译速度提高方法
- 关于集成支付宝快捷支付(无线)的流程
- android 获取 imei号码
- HashSet