【二分】hdu 4033

來源:互聯網
上載者:User
#define LL long long#define PI acos(-1.0)#define N  105#define MAX INT_MAX#define MIN INT_MIN#define eps 1e-8double a[N];int n;double maxm;double cal(double aa,double bb,double cc ){    return (aa*aa+bb*bb-cc*cc)/(2*aa*bb);}int gao(double x){    int i,j;    double res=0.0;    for(i=0;i<n;i++){        if(a[i]+a[(i+1)%n]<=x)return 0;//big        if(fabs( a[i]-a[(i+1)%n] )>=x)return -1;//small        double tmp=cal(a[i],a[(i+1)%n],x);        res+=acos(tmp);    }    if(fabs(res-2*PI)<eps)return 1;//equal    else    if(res<2*PI)return -1;//small    else    if(res>2*PI)    return 0;//big}int main(){    int t;    scanf("%d",&t);    int ca=1;    while(t--){        scanf("%d",&n);        int i,j;        maxm=0.0;        for(i=0;i<n;i++){            scanf("%lf",&a[i]);            if(a[i]>maxm)maxm=a[i];        }        double l=0,r=2*maxm,mid;        bool flag=0;        while((r-l)>eps){            mid=(l+r)/2.0;//cout<<mid<<endl;            int tag=gao(mid);            if(tag==1){                flag=1;                break;            }            if(tag==0){//big                r=mid;            }            else{//small                l=mid;            }        }        printf("Case %d: ",ca++);        if(!flag)printf("impossible\n");        else{            printf("%.3f\n",mid);        }    }    return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.