Hdu oj 2553 Elevator(坑题)
来源:互联网 发布:更改音乐的软件 编辑:程序博客网 时间:2024/05/18 03:41
Elevator
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63476 Accepted Submission(s): 34942
Problem Description
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.
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
There are multiple test cases. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100. A test case with N = 0 denotes the end of input. This test case is not to be processed.
Output
Print the total time on a single line for each test case.
Sample Input
1 23 2 3 10
Sample Output
1741
Author
ZHENG, Jianqiang
Source
ZJCPC2004
题水的一比,然而也坑的一比,谁家电梯同一楼层停留需要算两次的,出题人你没坐过电梯么?MDZZ
#include<cstdio>#include<iostream>using namespace std;int main(){ int n; int a[500]; while(cin>>n && n) { for(int i=0;i<n;i++) { cin>>a[i]; } int sum = a[0] * 6 + 5; for(int i=1;i<n;i++) { if(a[i] >= a[i-1]) { sum += (a[i] - a[i-1]) * 6 + 5; } else { sum += (a[i-1] - a[i]) * 4 + 5; } } cout<<sum<<endl; }}
0 0
- Hdu oj 2553 Elevator(坑题)
- hdu-oj 1008 Elevator
- HDU--Elevator(水题)
- hdu 1008(Elevator)
- 【杭电-oj】-1008-Elevator(电梯)
- HDU 1008 Elevator(水~)
- HDU 1008 Elevator(模拟)
- hdu Elevator
- HDU Elevator
- Elevator HDU
- Elevator HDU
- hdu Elevator
- 杭电OJ Elevator
- 南邮 OJ 1996 ELEVATOR
- HDU - 1008 Elevator(模拟题)
- HDU 1008 Elevator(模拟题)
- HDU 1008 Elevator
- hdu 1008Elevator
- 腾讯信鸽自定义推送通知
- 《OpenCV2计算机视觉编程手册》2-8定义感兴趣区域(打水印)
- _snprintf_s()函数的正确用法
- C - Sacrament of the sum
- var tensquared=(function(x) {return x*x;}(10)); //这是一个函数表达式 问:为什么花括号后面还有一个(10)的?而且整个句子用()扩起来?这个是什么表
- Hdu oj 2553 Elevator(坑题)
- OTG
- nyoj 116 士兵杀敌(二)<经典树状数组-插点问线>
- 空心三角形
- eclipse4.5在线安装Aptana3插件报错解决方案
- Vmware vSphere client手动更改mac地址
- SDUT2132数据结构实验之栈二:一般算术表达式转换成后缀式(栈)
- Java 打印水仙花数
- android - TextView单行显示...或者文字左右滚动(走马灯效果)