UVA 10714 Ants

Greedy, the ant-turn is equivalent to passing through, so in the middle as a distinguishing point, the shortest time is left to go to the left, right to the right, the longest time is left to the right to go, right to the left

1#include <iostream>2#include <cstdio>3#include <algorithm>4 #defineMAXN 10000005 6 using namespacestd;7 8 intt,mint,maxt,n,l;9 intMain ()Ten { Onescanf"%d",&T); A      while(t--) -     { -scanf"%d%d",&l,&n); the         intmid=l/2, A; -Mint=0, maxt=0; -          for(intI=0; i<n;i++) -         { +scanf"%d",&a); -             if(a>mid) +             { Amaxt=Max (maxt,a); atMint=max (mint,l-a); -             } -             Else -             { -Maxt=max (maxt,l-a); -Mint=Max (mint,a); in             } -         } toprintf"%d%d\n", mint,maxt); +     } -     return 0; the}

View Code

UVA 10714 Ants