HDOJ 1008 Elevator
来源:互联网 发布:mac怎么显示包内容 编辑:程序博客网 时间:2024/05/22 17:26
Elevator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58979 Accepted Submission(s): 32379
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
Author
ZHENG, Jianqiang
Source
ZJCPC2004
题意:给你一个N,表示要停靠的楼层数量,再给你N个要停靠的楼层,从第0层开始(注意,这里有违反常理的地方,是从第0层开始的而不是从第一层开始的),每上一层楼花费6秒,每下一层楼花费4秒,每停靠一次花费5秒,问总共需要多少时间。
题意简单明确,直接进行模拟即可。
#include<stdio.h>int main(){int n;while(scanf("%d",&n)&&(n!=0)){int s=n*5,t=0;while(n--){int a,b,c;scanf("%d",&a);if((a-t)>0)s=s+(a-t)*6;if((a-t)<0)s=s+(t-a)*4;t=a;}printf("%d\n",s);}}
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 (模拟题)
- R语言实现SOM(自组织映射)模型(三个函数包+代码)
- hrbust 哈理工OJ 2133 最快通过【dijkstra过】
- Android之Context详解
- NodeJS Connect 简单路由中间件
- Android保证首次获取到的location对象不为空的解决方案
- HDOJ 1008 Elevator
- Android之图片加载库Picasso源码分析
- opencv 行人计算,详细分析(每行解释)---给女朋友看的,初学者T T
- 使用div为网页布局
- android:第二个anroid项目 电话拨号器
- java.lang.NoClassDefFoundError: javax/persistence/Cacheable
- Hibernate【1】(安装 JBoss Tools,集成Hibernate)
- Android之-异步消息处理机制
- Alex-Word-Filter-MFC网络版(修正版)