Pro1

原始文件为 CPP 代码，本文是转换后的 Markdown 文件。

#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <string>
#include <cstdlib>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

const int maxn = 100005;
int data[maxn];
int main()
{
    freopen("in.txt","r",stdin);
    int n;
    scanf("%d",&n);
    for (int i = 0; i < n; ++i)
        scanf("%d",&data[i]);

    int max = data[0];
    int min = data[n-1];
    if (max < min)
    {
        int temp = max; max = min; min = temp;
    }
    int mid = 0;
    bool flag = false;
    if (n%2)
    {
        mid = data[n/2];
    }else
    {
        int sum = data[n/2-1]+data[n/2];
        if (sum % 2)
        {
            flag = true;
        }
        mid = sum/2;    
    }

    if (flag)
        printf("%d %d.5 %d\n",max,mid,min);
    else
        printf("%d %d %d\n",max,mid,min);
    return 0;
}