zoukankan      html  css  js  c++  java
  • hdu 1008 elevoter

    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
     
    #include<iostream>
    
    using namespace std;
    
    int main()
    {
    	int n,num;
    	while(cin>>n,n)
    	{
    		int start=0,t=0;
    		for(int i=0;i<n;i++)
    		{
    			cin>>num;
    		if(num>start)
    		{
    			t+=(num-start)*6;
    		}
    		if(num<start)
    		{
    			t+=(start-num)*4;
    		}
    		t+=5;
    		start=num;
    		
    		}
    		cout<<t<<endl;
    	}
    }
    
    Sample Output
    17 41
     
    代码如下
  • 相关阅读:
    第三方登录(QQ登录)开发流程详解
    网页优化方案
    linux中PHP链接MySQL主机127.0.0.1与localhost
    RSync实现文件备份同步
    网站攻击以及解决方案
    迎难而上,QPS提高22+倍
    新的一扇窗
    边缘计算开源平台
    高并发分布式计算-生产实践
    分布式UUID的生成
  • 原文地址:https://www.cnblogs.com/zhuy/p/2610054.html
Copyright © 2011-2022 走看看