题目
试题编号: 201903-1
试题名称: 小中大
时间限制: 1.0s
内存限制: 512.0MB
使用语言:C++
得分:100
解题思路
由题目可得
代码
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int A[100000] = {0};
int n, max, min, mid;
double mid2;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &A[i]);
}
if (A[0] > A[n - 1])
{
max = A[0];
min = A[n - 1];
if (n % 2 == 0 && (A[n / 2 - 1] + A[n / 2]) % 2 != 0)
{
double x = (A[n / 2 - 1] + A[n / 2]) / 2.0 * 10 + 0.5;
int y = (int)x;
mid2 = y / 10.0;
printf("%d %0.1f %d", max, mid2, min);
}
else if (n % 2 == 0 && (A[n / 2 - 1] + A[n / 2]) % 2 == 0)
{
mid = (A[n / 2 - 1] + A[n / 2]) / 2;
printf("%d %d %d", max, mid, min);
}
else
{
mid = A[n / 2];
printf("%d %d %d", max, mid, min);
}
}
else if (A[0] < A[n - 1])
{
min = A[0];
max = A[n - 1];
if (n % 2 == 0 && (A[n / 2 - 1] + A[n / 2]) % 2 != 0)
{
double x = (A[n / 2 - 1] + A[n / 2]) / 2.0 * 10 + 0.5; //两个整数的除法结果会得到整数,所以要将其中一个整数转为double
int y = (int)x;
mid2 = y / 10.0;
printf("%d %0.1f %d", max, mid2, min);
}
else if (n % 2 == 0 && (A[n / 2 - 1] + A[n / 2]) % 2 == 0)
{
mid = (A[n / 2 - 1] + A[n / 2]) / 2;
printf("%d %d %d", max, mid, min);
}
else
{
mid = A[n / 2];
printf("%d %d %d", max, mid, min);
}
}
else
{
max = min = mid = A[0];
printf("%d %d %d", max, mid, min);
}
system("pause");
return 0;
}