杭电1008 Elevator
2014-01-13 20:42
399 查看
Elevator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40520 Accepted Submission(s): 22177
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
Print the total time on a single line for each test case.
[align=left]Sample Input[/align]
1 2
3 2 3 1
0
[align=left]Sample Output[/align]
17
41
#include<iostream> using namespace std; int main() { int t0,t,n,sum,k; while(cin>>n&&n!=0) { t0=0; sum=0; k=0; while(n--) { cin>>t;; if(t>t0) sum+=(t-t0)*6; else sum+=(t0-t)*4; t0=t; k++; } sum+=k*5; cout<<sum<<endl; } return 0; }
相关文章推荐
- 互联网大佬的"名言警句"大汇总!
- 递推—杭电2044 一只小蜜蜂...
- Python画图
- SGU 467 Chessmaster 几何
- Extjs4 图片上传 上传成功后显示图片
- tpcc
- SGU 467 Chessmaster 几何
- 工厂方法模式---重写计算器(C++)
- I/O异步demo
- SWERC 2011 / HDU 4196 Remoteland (数论&想法题)
- 山寨腾讯“爱消除”游戏之框架总结
- POJ 2784 Buy or Build 最小生成树
- POJ 2784 Buy or Build 最小生成树
- IT与户外精神 推荐
- bh第一学期总结
- 2014加油
- 异步I/0基础
- telnet服务器源码安装
- URAL 1023 Buttons 博弈
- URAL 1023 Buttons 博弈