PAT甲级1008水题飘过

题目分析：上去下来到达的时间和数量

 #include<iostream>
 using namespace std;

 int k[];

 int main(){
     int n;
     while(scanf("%d", &n) != EOF){
         int ans = ;
         int floor = ;
         ans += n*;
         for(int i = ; i <= n; i++){
             scanf("%d", &k[i]);
             if(k[i] > floor){
                 ans += (k[i] - floor) * ;
                 floor = k[i];
             }
             else if(k[i] < floor){
                 ans += (floor - k[i]) * ;
                 floor = k[i];
             }
         }
         printf("%d\n", ans);
     }
     return ;
 }