zoukankan      html  css  js  c++  java
  • Elevator(hdoj 1008)

    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<stdio.h>/*一道水题,秒杀*/
     2 int main()
     3 {
     4     int N;
     5     while(scanf("%d",&N)==1)
     6     {
     7         if(N==0)
     8             break;
     9         int a[101],i,j,time=0,k;
    10         a[0]=0;
    11         for(i=1;i<=N;i++)
    12             scanf("%d",&a[i]);
    13         for(i=1;i<=N;i++)
    14             time+=(a[i]-a[i-1]>0?(a[i]-a[i-1])*6:(a[i-1]-a[i])*4)+5;
    15         printf("%d
    ",time);
    16     }
    17 } 
  • 相关阅读:
    python面试题
    面试总结
    552 Student Attendance Record II 学生出勤记录 II
    551 Student Attendance Record I 学生出勤纪录 I
    547 Friend Circles 朋友圈
    546 Remove Boxes 移除盒子
    543 Diameter of Binary Tree 二叉树的直径
    542 01 Matrix 01 矩阵
    3.1 特性
    2.6 datetime 模块
  • 原文地址:https://www.cnblogs.com/a1225234/p/4496152.html
Copyright © 2011-2022 走看看