1008. Elevator (20)
来源:互联网 发布:电动汽车数据 编辑:程序博客网 时间:2024/05/01 15:27
1008. Elevator (20)
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 <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <iostream>using namespace std;int main(){int N;scanf("%d",&N);int sum = 0;int floor,cur = 0;for(int i=1; i<=N; i++){scanf("%d",&floor);if(cur<floor)sum += 6*(floor-cur);elsesum += 4*(cur-floor);sum += 5;cur = floor;}printf("%d\n",sum);return 0;}
- 1008. Elevator (20)
- 1008. Elevator (20)-PAT
- 【PAT】1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- PAT 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- PAT 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- 1008. Elevator (20)
- Linux学习笔记(二)g++_gdb
- 【POJ 3004】Subway planning(极角排序+贪心)
- 单例模式的进化过程
- C++get函数
- 静思人生
- 1008. Elevator (20)
- 第2周项目2-程序的多文件组织
- OkHttp3源码详解(二整体流程)
- Java笔记 - 抽象类
- (转)Html的样式使用
- 各大公司广泛使用的在线学习算法FTRL详解
- 现在的网页设计居然是这样发展过来的
- 树链剖分学习专题
- Codeforces Round #345 (Div. 2) E. Table Compression(并查集)★ ★