zoukankan      html  css  js  c++  java
  • UVA

    最多时间就是每仅仅蚂蚁选择最久的爬行方式


    最少时间就是每仅仅蚂蚁选择最快地爬行方式

    #include<iostream>
    #include<map>
    #include<string>
    #include<cstring>
    #include<cstdio>
    #include<cstdlib>
    #include<cmath>
    #include<queue>
    #include<vector>
    #include<algorithm>
    using namespace std;
    int main()
    {
    	int a,b,i,T,len,n,t;
    	cin>>T;
    	while(T--)
    	{
    		cin>>len>>n;
    		a=b=0;
    		while(n--)
    		{
    			cin>>t;
    			a=max(a,min(len-t,t));
    			b=max(b,max(len-t,t));
    		}
    		cout<<a<<" "<<b<<endl;
    	}
    	return 0;
    }


    Time Limit:3000MS   Memory Limit:Unknown   64bit IO Format:%lld & %llu

    Status

    Description

    Download as PDF

    Problem B: Ants

    An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they turn back and start walking in opposite directions. We know the original positions of ants on the pole, unfortunately, we do not know the directions in which the ants are walking. Your task is to compute the earliest and the latest possible times needed for all ants to fall off the pole.

    The first line of input contains one integer giving the number of cases that follow. The data for each case start with two integer numbers: the length of the pole (in cm) andn, the number of ants residing on the pole. These two numbers are followed byn integers giving the position of each ant on the pole as the distance measured from the left end of the pole, in no particular order. All input integers are not bigger than 1000000 and they are separated by whitespace.

    For each case of input, output two numbers separated by a single space. The first number is the earliest possible time when all ants fall off the pole (if the directions of their walks are chosen appropriately) and the second number is the latest possible such time.

    Sample input

     
    2
    10 3
    2 6 7
    214 7
    11 12 7 13 176 23 191
    

    Output for sample input

    4 8
    38 207
    

    Piotr Rudnicki

    Source

    Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Greedy ::Non Classical, Usually Harder
    Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 4. Algorithm Design

    Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms ::Greedy - Standard
    Root :: Prominent Problemsetters :: Piotr Rudnicki

  • 相关阅读:
    浅谈移动端设备标识码:DeviceID、IMEI、IDFA、UDID和UUID
    Linux下的crontab定时执行任务命令详解
    SHOW INDEX查询MySQL表索引
    Vue非父子组件传值方式。
    windows 双网卡 内外网上网配置说明
    战神引擎部署备注说明
    k8s service直接暴露外部访问配置
    Kubernetes 五种资源控制器详细介绍以及功能演示(转)
    docker网络
    在Linux服务器,一键搭建K8s服务【脚本篇】(转)
  • 原文地址:https://www.cnblogs.com/mengfanrong/p/5092620.html
Copyright © 2011-2022 走看看