Elevator
来源:互联网 发布:linux查看当前用户 编辑:程序博客网 时间:2024/05/23 15:48
Elevator
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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>#include <string.h>#include <stdlib.h>int main(){ int sx[99999]; int n,m,i,j,k,sum; while(scanf("%d",&n),n) { sum = 0; for(i = 0;i < n;i++) { scanf("%d",&sx[i]); if(i == 0) { sum += sx[i] * 6; } else { j = sx[i] - sx[i-1]; if(j > 0) { sum += j * 6; } else if(j < 0) { j = -j; sum += j * 4; } } } sum += 5 * n; printf("%d\n",sum); } return 0;}
0 0
- Elevator
- Elevator
- Elevator
- elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- Elevator
- zuhfsafash
- [题解][LeetCode][Pascal's Triangle II]
- CD - UVa 624 01背包记录路径
- 若出现组图,概括出公有元素。
- jQuery中的ajax
- Elevator
- C#:ADO.NET简介
- MFC中使用GetParent获得子窗口的父窗口句柄
- 输入10个整数,将其中最小的数与第一个数对换,把最大的数和最后一个数对换,写三个函数:1.输入10个数,2.进行处理.3输出10个数
- 迷失的大多数
- python 字符串第n次出现的位置
- 上拉下拉寄存器使能
- HDU 1498 50 years, 50 colors(匈牙利算法 二分最大匹配数)
- WebService优点和缺点