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

    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 A[110],n,sum;
     3 int main() {
     4     while(scanf("%d",&n)&&n!=0) {
     5         sum=5*n;
     6         int x,y=0;
     7         for(int i=1;i<=n;++i) {
     8             scanf("%d",&x);
     9             if(x>y)
    10             sum+=6*(x-y);
    11             else
    12             sum+=4*(y-x);
    13             y=x;
    14         }
    15         printf("%d\n",sum);
    16     }
    17     return 0;
    18 }
  • 相关阅读:
    unittest用法和report输出
    python断言方式
    python闭包等
    html 基础
    Python装饰器
    python递归取出n层嵌套列表里的所有元素
    pycharm问题集锦
    Coding the Futurn
    python3-端口扫描(TCP_ACK扫描,NULL扫描,windows扫描,xmas扫描)
    python3-端口扫描(TCP connect扫描,SYN扫描,FIN扫描)
  • 原文地址:https://www.cnblogs.com/xiaxiaosheng/p/3041103.html
Copyright © 2011-2022 走看看