hdu 4033 /成都网络赛 Regular Polygon

//通过两个面积公式相等二分求解边长

//一开始没有预处理上下界，而且粗心写错公式，调试了半天，但神奇的1A了。不过还是觉得代码有bug。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <string>
#include <algorithm>
using namespace std;
const double EP=1e-6;
const double Pi=acos(-1.0);
int n;
double d[105], k, tmin, tmax;
double f(double x){
    int i;
    double s=0, t;
    for(i=0; i<=n-1; i++){
        t=(d[i]+d[i+1]+x)/2;
        s+=sqrt(t*(t-d[i])*(t-d[i+1])*(t-x));
    }
    return s-k*x*x;
}

int main(){
    //freopen("1.txt", "r", stdin);
    int T, i, test=1;
    scanf("%d", &T);
    while(T--){
        scanf("%d", &n);
        k=0.25/tan(Pi/n)*n;
        for(i=0; i<n; i++)
            scanf("%lf", &d[i]);
        d[n]=d[0];
        tmin=0;
        tmax=10000;
        for(i=0; i<=n-1; i++){
            if(tmax>d[i]+d[i+1])
                tmax=d[i]+d[i+1];
            if(tmin<fabs(d[i]-d[i+1]))
                tmin=fabs(d[i]-d[i+1]);
        }
        if(tmax<=tmin||tmin<-EP||tmax>10000){
            printf("Case %d: impossible\n", test++);
            continue;
        }
        double max=tmax, min=tmin, mid;
        while(max>min+EP){
            mid=(max+min)/2;
            if(f(mid)<0){
                max=mid;
            }
            else min=mid;
        }
        if(mid>tmax-EP||mid<tmin+EP){
            printf("Case %d: impossible\n", test++);
            continue;
        }
        printf("Case %d: %.3f\n",test++,  mid);
    }
    return 0;
}