1012 Stacking Cylinders

#include<stdio.h>#include<cmath>#include<algorithm>using namespace std;int main(){int n;while(scanf("%d",&n),n!=0){ double x[11];int i;for(i=1;i<=n;i++) scanf("%lf",x+i);sort(x+1,x+n+1);//caution!!!double tx[11];for(i=1;i<=n;i++) tx[i]=(x[1]+x[1+i-1])/2;double y=1.0;for(int i=1;i<n;i++){ y+=sqrt(4-(tx[i+1]-tx[i])*(tx[i+1]-tx[i]));}printf("%.4f %.4f/n",tx[n],y);}} 

只有一个注意的！！！输入数据要排序！！！坑人啊！！！