确实水题,不难
硬是要挑一个唯一的话,=》:
while(cin >> N,N)
代码实现:
#include <iostream>
using namespace std;
int main()
{
int N;
while(cin >> N,N){
int floor_order[N];
int initial_layer = 0; //初始的层数
int total_time = 0; //总时间
for(int i = 0;i < N ;i ++){
cin >> floor_order[i];
int status = floor_order[i] - initial_layer; //当前状态,上升还是下降
if(status > 0){
total_time = total_time + (floor_order[i] - initial_layer) * 6;
}
else{
total_time = total_time + (floor_order[i] - initial_layer) * (- 4);
}
total_time = total_time + 5;
initial_layer = floor_order[i];
}
cout << total_time << endl;
}
return 0;
}