class AntMoves {
    public static void main(String args[]) {
        int length = 27;
        int [] pose = {1,2,3,4,5};

    
        System.out.println("max->"+max(pose,length));
        System.out.println("max->"+min(pose,length));
    }
   
    public static int max(int pose[],int len){
    int max;
    int []temp = new int[pose.length];
    for (int i = 0; i < pose.length; i++) {
     temp[i] = len - pose[i];
    }
     return max(temp);
    }
    public static int min(int pose[],int len){
     int []sum = new int[5];
     for(int i= pose.length-1;i>0;i--){
      if(len-pose[i]>pose[i]){
       sum [i] = pose[i];
      
    }else{
          sum[i] = len - pose[i];
    }
     }
     return max(sum);
    
    }
    public static int max(int pose[]){
     int max = pose[0];
     for(int i=0;i<pose.length;i++){
     if(max<pose[i]){
     max = pose[i];
     }
   }
      return max;
    }
    /**
     * 插入排序(从小到大）
     */
    public static int[] sort(int pose[]){
    for (int i = 1; i < pose.length; i++) {
          int j = i;
          while (pose[j - 1] > pose[i]) {
           pose[j] = pose[j - 1];
            j--;
            if (j <= 0) {
              break;
            }
          }
          pose[j] = pose[i];
        }
    return pose;
    }

   
 }