POJ--1852--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) 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.
输出描述:
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.
输入：
2
10 3
2 6 7
214 7
11 12 7 13 176 23 191
输出：
4 8
38 207
题意：
一队蚂蚁在一根水平杆上行走，每只蚂蚁固定速度 1cm/s. 当一只蚂蚁走到杆的尽头时，立即从秆上掉落. 当两只蚂蚁相遇时它们会掉头向相反的方向前进. 我们知道每只蚂蚁在杆上的初始位置, 但是, 我们不知道蚂蚁向哪个方向前行. 你的任务是计算所有蚂蚁从杆上掉落可能的最短时间和最长时间.
题解：
因为是同时出发的，相遇时的两只蚂蚁用的时间是相同的，我们可以无视蚂蚁的区别，当两只蚂蚁相遇时它们保持原样交错而行。这样每只蚂蚁都是独立运动的，那么只要找每只蚂蚁掉下去的时间就行了。
代码：

#include<cstring>
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn = 1000000 + 5;
int a[maxn];

int main(){
    int t,n,l;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&l,&n);
        for(int i = 0; i < n; i ++){
            scanf("%d",&a[i]);
        }
        int maxx = 0;
        for(int i = 0; i < n; i ++){
            maxx = max(maxx,max(a[i],l - a[i]));
        }
        int minn = 0;
        for(int i = 0; i < n; i ++){
            minn = max(minn,min(a[i],l - a[i]));
        }
        printf("%d %d\n",minn,maxx);
    }
    return 0;
}