1008. Elevator (20)
2018-02-10 15:07
309 查看
1008. Elevator (20)
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue
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
时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue
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
#define _CRT_SECURE_NO_WARNINGS #include <unordered_map> #include <algorithm> #include <iostream> #include <iomanip> #include <cstring> #include <string> #include <vector> #include <stack> #include <queue> #include <map> using namespace std; int main() { #ifdef _DEBUG freopen("data.txt", "r+", stdin); #endif // _DEBUG int n,sec = 0,cur = 0,nxt; cin >> n; while (n--) { cin >> nxt; if (nxt > cur) sec += (nxt - cur) * 6 + 5; else sec += (cur - nxt) * 4 + 5; cur = nxt; } cout << sec; return 0; }
相关文章推荐
- 1008. Elevator (20)
- PAT-PAT (Advanced Level) Practise 1008. Elevator (20) (简单模拟)【一星级】
- 1008. Elevator (20)
- 1008. Elevator (20)
- PAT甲级1008. Elevator (20)
- 1008. Elevator (20)
- PAT1008. Elevator (20)
- 1008. Elevator (20)
- PAT_A 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)(C++)
- PAT-A 1008. Elevator (20)
- PAT 1008. Elevator (20)
- 1008. Elevator (20)
- 【PAT】【Advanced Level】1008. Elevator (20)
- PAT1008. Elevator (20)
- pat1008. Elevator (20)
- pat 1008. Elevator (20)
- Programming Ability Test学习 1008. Elevator (20)
- 1008. Elevator (20)