PAT (Advanced Level) Practise 1008 Elevator
来源:互联网 发布:js实现图片轮播 编辑:程序博客网 时间:2024/04/28 05:06
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 <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>#include <queue>#include <stack>using namespace std;int n,a[200];int main(){ while(~scanf("%d",&n)) { a[0]=0; int sum=0; for(int i=1;i<=n;i++) { scanf("%d",&a[i]); if(a[i]>a[i-1]) sum+=(a[i]-a[i-1])*6+5; else sum+=(a[i-1]-a[i])*4+5; } printf("%d\n",sum); } return 0;}
- PAT (Advanced Level) Practise 1008 Elevator (20)
- PAT (Advanced Level) Practise 1008 Elevator
- 浙大PAT (Advanced Level) Practise 1008 Elevator (20)
- PAT (Advanced Level) Practise 1008. Elevator (20)
- PAT (Advanced Level) Practise 1008. Elevator (20)
- 1008. Elevator (20)——PAT (Advanced Level) Practise
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1008(Elevator)
- PAT(Advanced level) 1008. Elevator
- hdu1039Easier Done Than Said?
- 求大数n,m下组合数C(n+m,m)%Mod
- Clickonce 发布后,无法下载
- 安卓中Window的概念
- Nginx配置proxy_pass
- PAT (Advanced Level) Practise 1008 Elevator
- CCF-201503-1-图象旋转
- UI层自动化测试框架(二):Appium基础
- linux 进程管理
- Hust oj 1426 集训队的晚饭(DP)
- JAVA基础6.32——构造代码块
- Apache&WAMP 解决80端口被占用问题
- 3. Longest Substring Without Repeating Characters
- ActionBar