Elevator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36319 Accepted Submission(s): 19791
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 2 3 2 3 1 0
Sample Output
17 41
题意:
根据给定楼层,计算分别到达相应楼层的总用时(超始楼层为0)
计算规则:
电梯上升用时6秒每层,下降用时4秒每层。不论上升还是下降到达指定楼层后电梯都会停留5秒
解题代码:
import java.util.Scanner;
public class Main1008 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while (sc.hasNext()) {
int num = sc.nextInt();
if (num == 0) {
break;
}
//当前楼层数
int currentFloor = 0;
int usedTime = 0;
while (num > 0) {
//目标楼层
int visitFloor = sc.nextInt();
int temp = visitFloor - currentFloor;
if (temp > 0) {
usedTime += temp*6+5;
} else {
usedTime += Math.abs(temp)*4+5;
}
currentFloor = visitFloor;
num--;
}
System.out.println(usedTime);
}
}
}