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.
 
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 2
3 2 3 1
0
 
Sample Output
17
41

#include <iostream> using namespace std; int main() { int a , b = 0 , c[1000],n ,t,time=0,k = 0; while(cin>>n&&n!=0) { time = 0 ; b = 0; for(int i = 0 ; i < n ; i ++) { cin>>a; t = a-b; if(t>0) time += t*6+5; else time += (-t)*4+5; b = a; } c[k] = time; k++; } for(int i = 0 ; i < k ; i ++) cout<<c[i]<<endl; return 0;

}











本文转自NewPanderKing51CTO博客,原文链接:http://www.cnblogs.com/newpanderking/archive/2011/07/23/2114939.html ,如需转载请自行联系原作者



相关文章
|
2月前
|
Go
early kdump
early kdump
|
传感器 算法 Linux
Perf Subsystem —— 基于PMI实现的NMI Watchdog
## 背景 任务能否被及时响应,对内核来说,至关重用。Linux kernel实现了softlockup和hardlockup,用于检测系统是否出现了长时间无响应。 &gt; A ‘softlockup’ is defined as a bug that causes the kernel to loop in kernel mode for more than 20 seconds, with
2112 1
HDOJ 1008 Elevator
HDOJ 1008 Elevator
94 0
|
人工智能
1008. Elevator (20)
简析:10分钟内ac,没有难度。 #include using namespace std; int main(int argc, const char * argv[]) { int n, f0 = 0, f...
855 0