POJ 1085 Ants

最新推荐文章于 2022-03-26 21:08:06 发布

孤独的娃娃菜

最新推荐文章于 2022-03-26 21:08:06 发布

阅读量231

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/pack__pack/article/details/51064080

版权

算法专栏收录该内容

27 篇文章 0 订阅

订阅专栏

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

n只蚂蚁以1cm/s的速度在L的杆子上爬行。当爬到杆子端点掉落，两只蚂蚁相遇时各自原路返回，对于每只蚂蚁只知道它距离左端距离xi，不知道它的朝向。计算所有的蚂蚁掉落所需最长时间和最短时间。

无视不同蚂蚁的区别
可以认为是保持原样的交错而过。

#include <iostream>
#include <cstdio>

using namespace std;

const int N=1000000+5;

int a[N];
int main(){

    int l,n,m;
    while(scanf("%d",&m)!=EOF){
    while(m--){
            scanf("%d%d",&l,&n);
                for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
        }
        int MAX=0,MIN=0;
        for(int i=0;i<n;i++){//MIN
            if(a[i]<=l/2){
                if(a[i]>=MIN){
                    MIN=a[i];
                }
            }
            if(a[i]>l/2){
                if(l-a[i]>=MIN){
                    MIN=l-a[i];
                }
            }
        }
        for(int i=0;i<n;i++){
            if(a[i]<=l/2){
                if(l-a[i]>=MAX){
                    MAX=l-a[i];
                }
            }
            if(a[i]>l/2){
                if(MAX<=a[i]){
                    MAX=a[i];
                }
            }
        }
        printf("%d %d\n",MIN,MAX);
    }

    }
    return 0;
}