解题思路:
设置一个当前层、一个目标层,每次到达目标层后更新当前层和目标层。累加所需时间即可。
代码:
#include <iostream>
using namespace std;
int main(){
int cur = 0, next, up = 6, down = 4, stay = 5, n, sum = 0;
cin>>n;
sum += stay*n;
for(int i = 0; i < n; i++){
cin>>next;
if(next > cur)
sum += up*(next-cur);
else
sum += down*(cur-next);
cur = next;
}
cout<<sum;
return 0;
}