zoukankan      html  css  js  c++  java
  • poj 1852 ants 题解《挑战程序设计竞赛》

    地址  http://poj.org/problem?id=1852

    题目描述

    Description

    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.
    Input

    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) and n, the number of ants residing on the pole. These two numbers are followed by n 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.
    Output

    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
    Sample Output
    
    4 8
    38 207

    算法1

     

    两只蚂蚁碰头后就各自回头 其实是一个思维陷阱, 它与两只蚂蚁碰头后就擦身而过是完全一样的
    那么只要计算每次蚂蚁的最小路径选择与最大路径选择即可

    #include <iostream>
    #include <algorithm>
    
    
    using namespace std;
    
    
    /*
    Sample Input
    
    2
    10 3
    2 6 7
    214 7
    11 12 7 13 176 23 191
    Sample Output
    
    4 8
    38 207
    
    */
    #define MAX_NUM  999999
    
    int ants[MAX_NUM];
    
    void Do(int ants[],int len,int num)
    {
        int longLen =0, shortLen = 0;
        for (int i = 0; i < num; i++) {
            longLen = max(longLen, max(ants[i], len - ants[i]));
            shortLen = max(shortLen, min(ants[i], len - ants[i]));
        }
    
        cout << shortLen << " " << longLen << endl;
    }
    
    int main()
    {
        int n = 0;
        cin >> n;
        for (int i = 0; i < n; i++) {
            int len = 0; int num = 0;
            cin >> len >> num;
            memset(ants,0,sizeof(ants));
            for (int j = 0; j < num; j++) {
                cin >> ants[j];
            }
            Do(ants,len,num);
    
        }
    }
    作 者: itdef
    欢迎转帖 请保持文本完整并注明出处
    技术博客 http://www.cnblogs.com/itdef/
    B站算法视频题解
    https://space.bilibili.com/18508846
    qq 151435887
    gitee https://gitee.com/def/
    欢迎c c++ 算法爱好者 windows驱动爱好者 服务器程序员沟通交流
    如果觉得不错,欢迎点赞,你的鼓励就是我的动力
    阿里打赏 微信打赏
  • 相关阅读:
    Python中变量的作用域
    Python中关于函数的介绍
    python列表中的赋值与深浅拷贝
    Python中关于集合的介绍及用法
    python中文件操作的六种模式及对文件某一行进行修改的方法
    python中文件操作的其他方法
    python中文件操作的基本方法
    python中字符串的一些用法
    python里字典的用法介绍
    小谈python里 列表 的几种常用用法
  • 原文地址:https://www.cnblogs.com/itdef/p/11331622.html
Copyright © 2011-2022 走看看