zoj 2108 Elevator

#include <iostream>#include <cstdio>#include <algorithm>using namespace std;const int maxn = 101;int req[maxn], n;int main(){    while(scanf("%d", &n) && n){        for(int i = 1; i <= n; ++i){ scanf("%d", &req[i]);        }        int ans = 0;        for(int i = 1; i <= n; ++i){     if(req[i] > req[i - 1]){         ans += (req[i] - req[i - 1]) * 6;     }else{         ans += (req[i - 1] - req[i]) * 4;     }     ans += 5;        }        printf("%dn", ans);    }    return 0;}