首页 > 代码库 > 杭电 1008 Elevator
杭电 1008 Elevator
杭电ACM 2014暑期集训队——选拔安排~ |
ElevatorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40905 Accepted Submission(s): 22387 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
Sample Output
Author ZHENG, Jianqiang 注意 同楼层要加时 #include<stdio.h> int main() { int n,a[105],i,s; while(~scanf("%d",&n)) { s=0; if(n==0) break; a[0]=0; for(i=1;i<=n;i++) scanf("%d",&a[i]); for(i=1;i<=n;i++) { if(a[i]>=a[i-1]) s=s+(a[i]-a[i-1])*6+5; else if(a[i]<a[i-1]) s=s+(a[i-1]-a[i])*4+5; } printf("%d\n",s); } return 0; } |
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。