[HDOJ 4520] 小Q系列故事――最佳裁判

题目描述

解题思路

参考代码

#include <stdio.h>
#include <math.h>
const int inf = 0x3f3f3f3f;
double arr[25];
int main()
{
int n,i;
while (~scanf("%d",&n) && n){
double max = -1,min = inf,sum = 0;
int p1,p2,p;
for (i = 0;i < n;i++){
scanf("%lf",&arr[i]);
sum += arr[i];
if (arr[i] > max)   max = arr[i],p1 = i;
if (arr[i] < min)   min = arr[i],p2 = i;
}
double score = (sum-max-min)/(n-2),eps = inf;
for (i = 0;i < n;i++){
if (fabs(arr[i]-score) < eps && i != p1 && i != p2){
p = i;
eps = fabs(arr[i]-score);
}
}
printf("%d\n",p+1);
}
return 0;
}