# 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.

Code:
1. #include <stdio.h>
2. #include <stdlib.h>
3.
4. int main()
5. {
6.     int now,sum,n,i,;
7.     while(1)
8.     {
9.          int floor[100]={0};
10.          sum=0;
11.          now=0;
12.          sum=0;
13.          scanf("%d",&n);     /*输入数字的个数*/
14.          if(n==0)        /*如果等于0则退出*/
15.          {
16.                     break;
17.          }
18.          for(i=0;i<n;i++)
19.          {
20.               scanf("%d",&floor[i]);   /*输入楼梯的阶数*/
21.          }
22.          for(i=0;i<n;i++)
23.          {
24.              if (floor[i]>now)        /*如果是上楼则执行*/
25.              {
26.                      sum +=(floor[i]-now)*6;
27.              }
28.              else
29.              {
30.                  sum +=(now-floor[i])*4;    /*下楼执行的语句*/
31.              }
32.              now=floor[i];
33.          }
34.             printf("%d",sum+n*5);  /*最后要加上停留的5秒*/
35.     }
36.     system("pause");
37.     return 0;
38. }
• 0
点赞
• 0
收藏
觉得还不错? 一键收藏
• 2
评论
03-06
10-17 734
07-14 697
03-09
12-07
07-10 149
04-13 315
05-06 994
11-28 339
09-01 2309
04-26 238
01-14 567

### “相关推荐”对你有帮助么？

• 非常没帮助
• 没帮助
• 一般
• 有帮助
• 非常有帮助

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。