poj 1852 Ants

cin和cout会超时

#include <cstdio>#include <algorithm>using namespace std;int main(){    int t,len,n,num;    scanf("%d",&t);    while(t--)    {        scanf("%d %d",&len,&n);        int minT = 0,maxT = 0;        for(int i = 0; i < n; ++i)        {            scanf("%d",&num);            minT = max(minT,min(num,len - num));            maxT = max(maxT,max(num,len - num));        }        printf("%d %d\n",minT,maxT);    }    return 0;}