HDU 1008-Elevator
来源:互联网 发布:js清空数组中所有元素 编辑:程序博客网 时间:2024/04/27 10:58
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
水题
代码如下:
#include <stdio.h>#include <stdlib.h>#define maxn 100/* run this program using the console pauser or add your own getch, system("pause") or input loop */int main(int argc, char *argv[]) {int a[maxn],i,sum,n;while(scanf("%d",&n)!=-1&&n){for(i=0;i<n;i++)scanf("%d",&a[i]);sum=0;sum+=6*a[0]+5;for(i=1;i<n;i++){if(a[i]>a[i-1]){sum+=6*(a[i]-a[i-1])+5;}else{sum+=4*(a[i-1]-a[i])+5;}}printf("%d\n",sum);}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
- openstack用bosh安装cloudfoundry(四)---用micro bosh部署bosh
- web学习-jsp客户端与Servlet的关联
- hdu 1016 Prime Ring Problem dfs
- Kahn算法-拓扑排序
- zzulioj 1783: 简单的求和 (筛选求和) 求和预处理 好题
- HDU 1008-Elevator
- HDU 5569 长度为n的上升子序列个数d (大数模板+DP)
- QTime中currentTime()的使用方法
- 前序遍历的层号表示转孩子数组表示法
- 大白-Dijksta模板
- 线索二叉树
- 《Go语言入门》如何在Windows下安装Go语言编程环境
- QT5与之前版本间问题整理
- 解析错误:解析软件包时出现问题