这章什么高效算法设计啊,这题初看貌似很高端,后来分析了集中情况,这连模拟题都不是,最弱智的数的大小,好吧,主要是分析蚂蚁极端情况,思路我就不透露了
#include <stdio.h>
#include <stdlib.h>
int ants[100000];
int main()
{
int len, t, max, min, n, lin;
scanf( "%d", &t );
while(t--)
{
scanf( "%d %d", &len, &n );
for( int i = 0; i < n; i++ )
scanf( "%d", &ants[i] );
max = -999;
min = 1000010;
for( int i = 0; i < n; i++ )
{
int temp = len-ants[i];
if( temp < ants[i] )
{
if( temp > max )
max = temp;
}
else
{
if( ants[i] > max )
max = ants[i];
}
}
for( int i = 0; i < n; i++ )
{
int temp = len-ants[i];
if( temp < ants[i] )
{
if( temp < min )
min = temp;
}
else
{
if( ants[i] < min )
min = ants[i];
}
}
printf( "%d %d\n", max, len-min );
}
return 0;
}