#include <iostream>
using namespace std;
int main()
{
int num;
int min, max, middle;
cin >> num;
int n[num];
for (int i = 0;i < num;i++)
{
int t;
cin >>t;
n[i] = t;
}
bool rise = 0;
if (n[0] > n[1])
rise = 0;
else if (n[0] < n[1])
rise = 1;
if (rise == 0)
{
max = n[0];
min = n[num-1];
if (num % 2 == 1)
middle = n[(num - 1) / 2];
else
middle = (n[num / 2] + n[num / 2 - 1]) / 2;
}
else
{
min = n[0];
max = n[num-1];
if (num % 2 == 1)
middle = n[(num - 1) / 2];
else
middle = (n[num / 2] + n[num / 2 - 1]) / 2;
}
cout << max << " " << middle << " " << min;
}
Tip:
本答案中并没有包含了所有情况。