zoukankan      html  css  js  c++  java
  • hd acm1008

    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.
     
    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
     
    Sample Way
     

    #include <stdio.h>
    #include <stdlib.h>

    int main()
    {
      int n,i,sum,floor[100]={0};
      while(scanf("%d",&n)==1&&n!=0)
      {
      sum=0;
      for(i=1;i<=n;i++)
      {
      scanf("%d",&floor[i]);
      }
      for(i=1;i<=n;i++)
      {
      if(floor[i]>floor[i-1]) sum+=(floor[i]-floor[i-1])*6;
      if(floor[i]<floor[i-1]) sum+=(floor[i-1]-floor[i])*4;
      }
      printf("%d ",sum+n*5);
      }
      return 0;
    }

     
  • 相关阅读:
    Asp.net操作Excel----NPOI
    Python第一模块
    Sping笔记一览
    IO流技术一览
    事务技术一览
    日常问题记录
    分页与JDBC显示文档。
    分页技术与JDBC一览
    JDBC 技术开发
    MYSQL
  • 原文地址:https://www.cnblogs.com/clljs/p/7423612.html
Copyright © 2011-2022 走看看