zoukankan      html  css  js  c++  java
  • Elevator

    题目描述

    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.

    输入描述:

    Each input file contains one test case. Each case contains a positive integer N, followed by N positive numbers. All the numbers in the input are less than 100.



    输出描述:

    For each test case, print the total time on a single line.

    输入例子:

    3 2 3 1

    输出例子:

    41

    #include<stdio.h>
    int main(){
        int n,f1,sum=0,f2=0,i=1;
        scanf("%d",&n);
        sum+=(5*n);
        while(i<=n){
            
            scanf("%d",&f1);
            if(f1-f2>0)
                sum+= ((f1-f2)*6);
             if(f1-f2<0)
                sum+= ((f2-f1)*4);
            f2=f1;
            i++;
        }
        printf("%d",sum);
    } 


  • 相关阅读:
    ASFNU SC Day6
    ASFNU SC Day3
    ASFNU SC Day2
    ASFNU SC Day1
    2017-9-3 校内模拟T2取数win
    2017-9-3 校内模拟T1卡片card
    (补题)苗条的树(poj_3522)
    跳跳棋(9018_1563)(BZOJ_2144)
    Java之JSP和Servlet基础知识。
    JSP中的九大内置对象
  • 原文地址:https://www.cnblogs.com/zhangzimu/p/9208078.html
Copyright © 2011-2022 走看看