首页 > 代码库 > YT14-先来练练手之电梯RUNTIME
YT14-先来练练手之电梯RUNTIME
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 2 3 2 3 1 0
Sample Output
17 41
代码如下：
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin>>n&&n!=0)
{
int a[n],i,sum=0;
if(n==1)
{
cin>>a[0];
cout<<(a[0]*6)+5<<endl;
}
else
{
for(i=0; i<n; ++i)
cin>>a[i];
sum+=(a[0]*6+5);
for(i=1; i<n; ++i)
{
if(a[i]>a[i-1])
sum+=(5+(a[i]- a[i-1])*6);
else
sum+=(5+(a[i-1]- a[i])*4);
}
cout<<sum<<endl;
}
}
return 0;
}
YT14-先来练练手之电梯RUNTIME
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。