HDU 1008 Elevator
来源:互联网 发布:874是什么意思网络用语 编辑:程序博客网 时间:2024/06/06 07:07
Elevator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 52319 Accepted Submission(s): 28883
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<pre name="code" class="objc">#include<stdio.h>int main(){ int n,a[101],i,s; a[0]=0; while(scanf("%d",&n)!=EOF) { s=0; if(n==0) return 0; for(i=1;i<=n;i++) { scanf("%d",&a[i]); } for(i=0;i<n;i++) { if(a[i]<a[i+1]) { s+=(a[i+1]-a[i])*6+5; } else { s+=(a[i]-a[i+1])*4+5; } } printf("%d\n",s); } return 0;}
0 0
- HDU 1008 Elevator
- hdu 1008Elevator
- HDU 1008 Elevator
- HDU 1008 Elevator
- hdu 1008 elevator 水
- HDU 1008 Elevator
- Hdu 1008 - Elevator
- HDU 1008 Elevator
- HDU--1008--Elevator
- hdu 1008 Elevator
- HDU-1008 Elevator
- HDU 1008 Elevator
- hdu 1008 Elevator
- Hdu--1008--Elevator
- hdu 1008 Elevator
- hdu 1008 Elevator
- hdu-1008-Elevator
- hdu 1008 Elevator
- Linux下的触摸板设置:以 Arch Linux 为例
- 装饰模式和python装饰器
- 判断单向链表中是否有环和查找环的入口
- Struts框架核心工作流程与原理
- 磁盘创建
- HDU 1008 Elevator
- zoj 1730 Crazy Tea Party(方向感太差,遇环就晕)
- 比快速排序还快的排序算法
- docker误区
- Leetcode #79 Word Search
- SimpleDateFormat使用详解
- 在C语言中 switch语句的用法
- 排序算法之选择排序
- java 验证码之 patchca