UVa 10714 - Ants

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

/*题意：求所有蚂蚁走下长杆的最长时间和最短时间*/

/*最短时间：先求出每个蚂蚁走下杆的最短时间。然后求出最短时间的最大值
最长时间：先求每个蚂蚁走下杆的最长时间。然后求出最长时间的最大值*/

int max(int a,int b){
if (a > b)return a;
else
return b;
}
int min(int a,int b){
if(a < b)return a;
else return b;
}
class Ant{
private:
int poleLenth;
int antNum;
int minTime ;
int maxTime ;
public:
void readData();
void process();
};
void Ant::readData(){
int cases;
scanf("%d",&cases);
while(cases--){
minTime = -1;
maxTime = -1;
scanf("%d%d",&poleLenth,&antNum);
for(int i = 0;i < antNum;i++){
process();
}
cout<<minTime<<" "<<maxTime<<endl;
}
}
void Ant::process(){
int local;
scanf("%d",&local);
minTime = max(minTime,min(local,poleLenth - local));
maxTime = max(maxTime,max(local,poleLenth - local));
}

int main()
{
Ant ant;
ant.readData();
return 0;
}