HDU 1008 Elevator
来源:互联网 发布:买黄金投资软件 编辑:程序博客网 时间:2024/06/05 06:04
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
题目大意:
一个电梯运行时间的计算,电梯上升一层需要6秒,电梯下降一层需要4面在需要停止的楼层停留5秒,然后按照输入楼层的顺序依次将客人送到指定楼层,并计算出送完所有客人所需要的时间,送完后不需要返回楼底。输入的楼层数不能大于100
解题思路:
我的方法是利用了数组,将去往的楼层数按照输入的先后顺序依次存数组中,然后根据楼层上下关系,判断下一次运行时上升还是下降,并通过楼层差来统计时间,获得最终的总时间。将运行搞清楚就不是就不难。
#include<stdio.h>#include<math.h>int main(){int i,n,count=0;int ceng[1000];while(scanf("%d",&n)&&n){for(i=0;i<n;i++){ceng[i]=0;}for(i=1;i<=n;i++){scanf("%d",&ceng[i]);if(ceng[i]>=100) {return 0;}}count=5*n;for(i=0;i<n;i++){if(ceng[i+1]>ceng[i]){count=count+6*(ceng[i+1]-ceng[i]);}else{count=count+4*(ceng[i]-ceng[i+1]);}}printf("%d\n",count);}return 0;}
0 0
- HDU 1008 Elevator
- hdu 1008Elevator
- HDU 1008 Elevator
- HDU 1008 Elevator
- hdu 1008 elevator 水
- HDU 1008 Elevator
- Hdu 1008 - Elevator
- HDU 1008 Elevator
- HDU--1008--Elevator
- hdu 1008 Elevator
- HDU-1008 Elevator
- HDU 1008 Elevator
- hdu 1008 Elevator
- Hdu--1008--Elevator
- hdu 1008 Elevator
- hdu 1008 Elevator
- hdu-1008-Elevator
- hdu 1008 Elevator
- Android ListView中的checkbox事件拦截
- Android LayoutInflater原理分析,带你一步步深入了解View(一)
- 欢迎使用CSDN-markdown编辑器
- golang 环境变量配置 及所遇到问题解决
- 3年程序生涯
- HDU 1008 Elevator
- 搭建sip软电话环境
- leetcode 25. Reverse Nodes in k-Group
- linux下devicetree中惯用的of函数
- python 矩阵转置transpose--实战应用详解
- 最近3周做前端的一些收货
- 使用 Smartmontools 检测硬盘坏道
- 【AngularJS】解决ng-if中的ng-model值无效的问题
- springMVC源码分析--SimpleUrlHandlerMapping(四)