题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805511923286016
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int res = 0;
int from=0,to;
while (n--) {
cin >> to;
if (to > from) {
res += 6 * (to - from)+5;
}
else if (to < from) {
res += 4 * (from - to)+5;
}
else {
res += 5;
}
from = to;
}
cout << res;
return 0;
}
楼梯一开始从0楼上,所以不用在while循环之前读入一次from,