zoukankan      html  css  js  c++  java
  • Hdu 1008 Elevator

    Elevator

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 72304    Accepted Submission(s): 39764

    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

    #include<stdio.h>int main()
    {
        int n;
        int start,a;
        int t;
        int i;
        while(scanf("%d",&n),n)
        {
            t=0;start=0;
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&a);
                if(a>start)t+=6*(a-start);
                else t+=4*(start-a);
                t+=5;
                start=a;
            }
            printf("%d
    ",t);
        }    
        return 0; 
    }  
    

      

  • 相关阅读:
    MySQL日志
    MySQL索引和事务
    【收集】腾讯AlloyTeam
    js基础知识点(只有点)
    【扩展】Canvas绘制列表的尝试
    开播 开博 凯博
    【总结】移动web问题小结
    〖前端开发〗HTML/CSS基础知识学习笔记
    第四次读书笔记——《代码大全》(续)
    C++笔记(1)
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057776.html
Copyright © 2011-2022 走看看