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): 74488    Accepted Submission(s): 41075


    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
     
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 #include <queue>
     6 #include <algorithm>
     7 using namespace std;
     8 int main()
     9 {
    10     int n,m,sum,lag;
    11     queue<int>mp;
    12     while(scanf("%d",&n)&&n)
    13     {
    14         sum=0;
    15         lag=0;
    16         for(int i=0;i<n;i++)
    17         {
    18             scanf("%d",&m);
    19             mp.push(m);
    20         }
    21         while(!mp.empty())
    22         {
    23             m=mp.front();
    24             mp.pop();
    25             sum+=abs(m-lag)*((lag-m)>0?4:6);
    26             lag=m;
    27             sum+=5;
    28         }
    29         printf("%d
    ",sum);
    30     }
    31     return 0;
    32 }
  • 相关阅读:
    grunt in webstorm
    10+ Best Responsive HTML5 AngularJS Templates
    响应式布局
    responsive grid
    responsive layout
    js event bubble and capturing
    Understanding Service Types
    To add private variable to this Javascript literal object
    Centering HTML elements larger than their parents
    java5 新特性
  • 原文地址:https://www.cnblogs.com/52why/p/7478104.html
Copyright © 2011-2022 走看看