1008 Elevator (20point(s))
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 Specification:
Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.
Output Specification:
For each test case, print the total time on a single line.
Sample Input:
3 2 3 1
Sample Output:
41
题目大意:从0层出发,每上升一层花费6秒,在目标层停留5秒,每下一层花费4秒,求总时间。
解题思路:题目很简单,看代码就行。
Java代码:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
int a, now = 0, sum = 0;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String s = br.readLine();
String[] str = s.split(" ");
int[] arr = new int[str.length];
for(int i=1; i<str.length; i++)
{
a = Integer.parseInt(str[i]);
if(a>now) {
sum += 6 * (a-now);
}else {
sum += 4 * (now-a);
}
now = a;
sum += 5;
}
System.out.println(sum);
}
}
C++代码:
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int now;
int before=0;
int sum=0;
for(int i=0; i<n; i++){
scanf("%d",&now);
if((now-before)>0){
sum+=6*(now-before);
}else{
sum+=4*(before-now);
}
before=now;
sum+=5;
}
printf("%d",sum);
}