Elevator
来源:互联网 发布:神马快递单打印软件 编辑:程序博客网 时间:2024/06/07 09:11
Elevator
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 46 Accepted Submission(s) : 22
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
#include<stdio.h>int main(){ int n,a[100],i; while(~scanf("%d",&n)&&n) { int s=0; for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;;) {s=a[0]*6;break;} for(i=1;i<n;i++) { if(a[i]>a[i-1]) s=s+(a[i]-a[i-1])*6; if(a[i]<a[i-1]) s=s+(a[i-1]-a[i])*4; } printf("%d\n",s+n*5); }}
0 0
- Elevator
- Elevator
- Elevator
- elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- SDUT 3068 为了相同的前缀-方程式计算 (数学) -- 解题报告
- Easyui datagrid行内【添加】、【编辑】、【上移】、【下移】
- 拦截聊天记录--Hook技巧简介【原创】
- Block
- 使用Mybatis-Generator自动生成Dao、Model、Mapping相关文件(转)
- Elevator
- 构造哈夫曼树的算法
- Spark学习笔记5-隐式转换,隐式参数,隐式类
- 第十章编程练习(3)
- 在Mac系统下安装mongodb两种方式
- 安卓项目中 一些常见 API接口总结
- POJ 2533 3903(最长递增子序列)
- HDU 5601 N*M bulbs
- 微信支付错误两个问题的解决:curl出错,错误码:60