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.
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 |
import java.util.ArrayList;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
while(input.hasNext()) {
ArrayList arry=new ArrayList();
for(int a=input.nextInt();a!=0;a=input.nextInt()) {
int c=0;
ArrayList arr=new ArrayList();
for(int i=a;i>0;i--) {
arr.add(input.nextInt());
}
for(int b=0;b<arr.size();b++ ) {
int m=(int)arr.get(b);
if(b==0) {
c+=(m*6)+5;
}else {
int m1=(int)arr.get((b-1));
if(m>m1) {
c+=((m-m1)*6)+5;
}else {
c+=((m1-m)*4)+5;
}
}
}
arry.add(c);
}
for(int i=0;i<arry.size();i++) {
System.out.println(arry.get(i));
}
}
}
}