杭电ACM4520 小Q系列故事——最佳裁判
#include <stdio.h> #include <stdlib.h> #define N 20 float a[N]; float myabs(float a) { return a>0?a:-a; } int main() { int n; int i; float sum; float avg; float min; int minI; float maxStore; float minStore; while(scanf("%d",&n)!=EOF&&n!=0) { avg=sum=0; min=10000; maxStore=0; minStore=100000; for(i=0;i<n;i++) { scanf("%f",a+i); sum+=a[i]; if(a[i]>maxStore) maxStore=a[i]; if(a[i]<minStore) minStore=a[i]; } sum=sum-maxStore-minStore; avg=sum/(n-2); for(i=0;i<n;i++) { if(min>myabs(a[i]-avg)) { min=myabs(a[i]-avg); minI=i; } } printf("%d\n",minI+1); } return 0; }
?转载请注明原文地址：http://uwind.iteye.com/blog/1928411
