Elevator
来源:互联网 发布:代表中国的域名后缀 编辑:程序博客网 时间:2024/05/22 10:31
/*Elevator
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
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 2
3 2 3 1
0
Sample Output
17
41
*/
#include<stdio.h>
int main()
{
int test,i;
while(~scanf("%d",&test),test!=0)
{
int a[110]={0};
int sum=0;
for(i=0;i<test;i++)
scanf("%d",&a[i]);
for(i=0;i<test-1;i++)//这一步判断是关键 ,注意i<test-1
{
if(a[i+1]>a[i])
sum+=(a[i+1]-a[i])*6;
else
sum+=(a[i]-a[i+1])*4;
}
printf("%d\n",sum+a[0]*6+test*5);
}
return 0;
}
- Elevator
- Elevator
- Elevator
- elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- HDU 4919 打表找规律 java大数 map 递归
- 頁面列印
- System.BadImageFormatException: 未能加载文件或程序集“Oracle.DataAccess”或它的某一个依赖项。试图加载格式不正确的程序。
- 漫步云中网络,第 2 部分---Neutron LbaaS的应用场景及实现要点
- win7+64位+Oracle+11g+64位下使用PLSQL+Developer+的解决办法
- Elevator
- 畅通工程 hdoj 1232
- HDOJ 题目1010Tempter of the Bone(搜索,dfs)
- NetConnection 工具类
- 自定义Tabbar实现push动画隐藏效果
- 解决linux下olt读取MySQL数据库中文乱码的问题
- VC Http提交表单
- 极客Web前端开发资源大荟萃#001
- C#学习笔记之初识C#