| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 31608 | 惠子铭 | 直方图 | C++ | Compile Error | 0 MS | 0 KB | 824 | 2023-11-19 19:55:19 |
源代码 #include<cstdio> #include<iostream> using namespace std; double a[300],b[300]; int main(void) { double max1=0,min=301; int i; double n,near,max2=0,p,s,d,c; scanf("%lf",&n); for(i=1;i<=n;i++) { scanf("%lf",&a[i]); s+=a[i]; } for(i=1;i<=n;i++) { if(max1<a[i]) { max1=a[i]; d=i; } } for(i=1;i<=n;i++) { if(a[i]<min) { min=a[i]; c=i; } } s=s-max1-min; p=1.0*s/(n-2); for(i=1;i<=n;i++) { if((i!=d)&&(i!=c)) { b[i]=p-a[i]; if(b[i]<0) b[i]=(-1)*b[i]; } else b[i]=-1; } for(int i=1;i<=n;i++) { if(b[i]>max2) max2=b[i]; } printf("%.2lf %.2lf\n",p,max2); return 0; }