POJ 1852 Ants

Posted 2020-06-20 Fighting Heart

蚂蚁掉头等于不掉头。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<stack>
#include<algorithm>
using namespace std;

const int maxn=1000000+10;
int T,n,L;
int x[maxn];

void read()
{
    scanf("%d%d",&L,&n);
    for(int i=1;i<=n;i++) scanf("%d",&x[i]);
}

void work()
{
    int Min=-999999999,Max=-999999999;
    for(int i=1;i<=n;i++)
    {
        Min=max(Min,min(L-x[i],x[i]));
        Max=max(Max,max(L-x[i],x[i]));
    }
    printf("%d %d\n",Min,Max);
}

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        read();
        work();
    }
    return 0;
}