C - Elevator
Time Limit:1000MS MemoryLimit:32768KB 64bit IO Format:%I64d& %I64u
Submit Status Practice HDU 1008
Appoint description:
Description
The highestbuilding in our city has only one elevator. A request list is made up with Npositive numbers. The numbers denote at which floors the elevator will stop, inspecified order. It costs 6 seconds to move the elevator up one floor, and 4seconds to move down one floor. The elevator will stay for 5 seconds at eachstop.
For a given request list, you are to compute the total time spent to fulfillthe requests on the list. The elevator is on the 0th floor at the beginning anddoes not have to return to the ground floor when the requests are fulfilled.
Input
There aremultiple test cases. Each case contains a positive integer N, followed by Npositive numbers. All the numbers in the input are less than 100. A test casewith N = 0 denotes the end of input. This test case is not to be processed.
Output
Print the totaltime on a single line for each test case.
Sample Input
1 2
3 2 3 1
0
Sample Output
17
41
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
while(in.hasNext()){
int n=in.nextInt();
if(n==0)break;
int []sum=new int[n+1];
int ans=0;
for(int i=1;i<=n;i++){
sum[i]=in.nextInt();
if(sum[i]>sum[i-1])ans+=(sum[i]-sum[i-1])*6;
else ans+=(sum[i-1]-sum[i])*4;
}
System.out.println(ans+5*n);
}
}
}