PAT1008. Elevator (20)
来源:互联网 发布:pdf文件合并软件 编辑:程序博客网 时间:2024/06/11 03:58
题目如下:
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 1Sample Output:
41
#include <iostream>using namespace std;int main() {int N, now = 0, sum = 0;int floor;cin >> N;for (int i = 0;i < N;i++){cin >> floor;if (floor > now)sum += (floor - now) * 6;else if (floor < now)sum += (now - floor) * 4;now = floor;sum += 5;}cout << sum;return 0;}所有用例都通过了,没有什么难度。
- PAT1008. Elevator (20)
- PAT1008. Elevator (20)
- pat1008. Elevator (20)
- PAT1008. Elevator (20)
- PAT1008 Elevator (20)
- PAT1008. Elevator (20)
- PAT1008. Elevator
- PAT1008. Elevator
- pat1008 Elevator
- PAT1008
- PAT1008
- pat1008
- PAT1008
- pat1008
- PAT1008
- PAT1008
- pat1008
- pat1008
- 静态代理模式(java),接口练习
- 动态规划----剖分问题
- 剪格子(迭代加深搜索)
- MongoDB 安装和可视化工具
- 织梦安全问题
- PAT1008. Elevator (20)
- ubuntu16 升级后找不到 eth0 网卡 的解决方法
- 51nod 1315
- 递归递推练习题–N14
- 96.来电归属地查询
- spring一站式框架(web层)
- "尚学堂杯"哈尔滨理工大学第七届程序设计竞赛
- 架构、框架和设计模式关系
- (1) linux 3.x