立志用最少的代碼做最高效的表達

---

PAT甲級最優題解——>傳送門

---

The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The elevator will stay for 5 seconds at each stop.

For a given request list, you are to compute the total time spent to fulfill the requests on the list. The elevator is on the 0th floor at the beginning and does not have to return to the ground floor when the requests are fulfilled.

Input Specification:
Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.

Output Specification:
For each test case, print the total time on a single line.

Sample Input:
3 2 3 1

Sample Output:
41

---

老老實實寫模擬，沒啥特殊點。

---

#include<bits/stdc++.h> using namespace std; typedef long long gg; int main() {gg stay = 0, sum = 0;;gg n; cin >> n; while(n--) {gg k; cin >> k;sum += (k-stay>=0 ? (5+ (k-stay)*6) : (5+ (stay-k)*4));stay = k;} cout << sum << '\n'; return 0; }

---

耗時：

超強干貨來襲 云風專訪：近40年碼齡，通宵達旦的技術人生

總結

以上是生活随笔為你收集整理的1008 Elevator (20 分)_13行代码AC的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。