CCF201903-1 小中大

最新推荐文章于 2024-08-13 08:29:35 发布

hi风清扬

最新推荐文章于 2024-08-13 08:29:35 发布

阅读量98

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/qq_18287147/article/details/106886745

版权

刷题专栏收录该内容

37 篇文章 0 订阅

订阅专栏

试题编号：	201903-1
试题名称：	小中大
时间限制：	1.0s
内存限制：	512.0MB

import java.util.Scanner;
public class Main
{
   public static void main(String[] args) {
       Scanner in = new Scanner(System.in);
       int n = in.nextInt();
       int []a = new int[n];
       for(int i = 0; i<n; i++){
       a[i] = in.nextInt();
       }
       int mid=0;
        double midF = 0;
       if(a[0] > a[n-1]){
       //如果逆序
       if(n % 2 == 0){ //如果偶数个数
       if( (a[n/2 - 1] + a[n/2]) % 2 == 0){
       mid = (a[n/2 - 1] + a[n/2]) / 2;
       System.out.println(a[0] + " " + mid + " " + a[n-1]);
       }else{
       midF = (a[n/2 - 1] + a[n/2]) / 2.0;
       System.out.println(a[0] + " " + midF + " " + a[n-1]);
       }
       }
       else{
       mid = a[n/2];
       System.out.println(a[0] + " " + mid + " " + a[n-1]);
       }

       }else if(a[0] < a[n-1]){
       //如果顺序
       if(n % 2 == 0){ //如果偶数个数
       if( (a[n/2 - 1] + a[n/2]) % 2 == 0){
       mid = (a[n/2 - 1] + a[n/2]) / 2;
       System.out.println(a[n-1] + " " + mid + " " + a[0]);
       }else{
       midF = (a[n/2 - 1] + a[n/2]) / 2.0;
       System.out.println(a[n-1] + " " + midF + " " + a[0]);
       }
       }
       else{
       mid = a[n/2];
       System.out.println(a[n-1] + " " + mid + " " + a[0]);
       }

       }else{
       //如果两数相等即不单调
       System.out.println(a[0] + " " + a[0] + " " + a[0]);
       }
   }
}