pat 1008 Elevator（20 分）

1008 Elevator（20 分）

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

 

 

 #include <map>
 #include <set>
 #include <queue>
 #include <cmath>
 #include <stack>
 #include <vector>
 #include <string>
 #include <cstdio>
 #include <cstring>
 #include <climits>
 #include <iostream>
 #include <algorithm>
 #define wzf ((1 + sqrt(5.0)) / 2.0)
 #define INF 0x3f3f3f3f
 #define LL long long
 using namespace std;

 const int MAXN = 1e6 + ;

 LL A[MAXN] = {}, n, ans = ;

 int main()
 {
     scanf("%lld", &n);
     for (LL i = ; i <= n; ++ i)
         scanf("%lld", &A[i]);
     ans += n * ;
     for (LL i = ; i <= n; ++ i)
         if (A[i - ] <= A[i])
             ans += (A[i] - A[i - ]) * ;
         else
             ans += (A[i - ] - A[i]) * ;
     printf("%lld\n", ans);
     return ;
 }