201903-1:小中大CSP测试80，求改进

Question

201903-1:小中大CSP测试80，求满分代码改进

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
    int n,  i;
    cin >> n;
    int a[100000];
    for (i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    int max = a[n - 1];
    int min = a[0];
    double mid;
    if (a[0] > a[n - 1])
    {
        max = a[0];
        min = a[n - 1];
    }
    if (n % 2 == 1)
    {
        mid = a[n / 2];
        cout << max << " " << int(mid) << " " << min;
    }
    if (n % 2 == 0)
    {
        mid = (a[n / 2] + a[n / 2 - 1]) / 2;
        if ((a[n / 2] + a[n / 2 - 1]) % 2 == 0)
        {
            cout << max << " " << int(mid) << " " << min;
        }
        else
        {
            cout << max << " " << fixed << setprecision(1) << mid << " " << min;
        }
        
    }
    return 0;
}

Answer 1

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
    int n,  i;
    cin >> n;
    int a[100000];
    for (i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    int max = a[n - 1];
    int min = a[0];
    double mid;
    if (a[0] > a[n - 1])
    {
        max = a[0];
        min = a[n - 1];
    }
    if (n % 2 == 1)
    {
        mid = a[n / 2];
        cout << max << " " << int(mid) << " " << min;
    }
    if (n % 2 == 0)
    {
        mid = (a[n / 2] + a[n / 2 - 1]) / 2.0; // 改成 2.0。不然整数除以整数自动下取整，结果错误。
        if ((a[n / 2] + a[n / 2 - 1]) % 2 == 0)
        {
            cout << max << " " << int(mid) << " " << min;
        }
        else
        {
            cout << max << " " << fixed << setprecision(1) << mid << " " << min;
        }
        
    }
    return 0;
}