zoukankan      html  css  js  c++  java
  • ZOJ 3203 Light Bulb(数学对勾函数)

    Light Bulb

    Time Limit: 1 Second      Memory Limit: 32768 KB

    Compared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious house, thinking of how to earn more money. One day, he found that the length of his shadow was changing from time to time while walking between the light bulb and the wall of his house. A sudden thought ran through his mind and he wanted to know the maximum length of his shadow.

    Input

    The first line of the input contains an integer T (T <= 100), indicating the number of cases.

    Each test case contains three real numbers Hh and D in one line. H is the height of the light bulb while h is the height of mildleopard. D is distance between the light bulb and the wall. All numbers are in range from 10-2 to 103, both inclusive, and H - h >= 10-2.

    Output

    For each test case, output the maximum length of mildleopard's shadow in one line, accurate up to three decimal places..

    Sample Input
    3
    2 1 0.5
    2 0.5 3
    4 3 4
    Sample Output
    1.000
    0.750
    4.000


    Author: GUAN, Yao
    Source: The 6th Zhejiang Provincial Collegiate Programming Contest

    #include <iostream>
    #include<cstdio>
    #include<cmath>
    using namespace std;
    int t;
    double h,H,D;
    int main()
    {
        while(~scanf("%d",&t))
        {
         for(;t>0;t--)
         {
             scanf("%lf%lf%lf",&H,&h,&D);
             //最优解在[x0,x2]之间,如果能取到x1,则影子最长
             //影子长度在此区间内,符合倒钩函数l=H+D-x-D*(H-h)/x
             double x0=D*(H-h)/H;//在墙壁上的影子长度为0时,人与灯的距离
             double x1=sqrt(D*(H-h));
             double x2=D;//人不断向后移(也就是向墙壁移动),最远到墙壁,人与灯的距离
             double x;
             if (x0<=x1 && x1<=D) x=x1; //区间包含x1
             else if(x2<=x1) x=x2;//区间在x1的左边,即最大值小于x1
             else if(x0>=x1) x=x0;//区间在x1的右边,即最小值大于x1
             printf("%.3lf
    ",H+D-x-D*(H-h)/x);
         }
        }
        return 0;
    }
  • 相关阅读:
    Latex文件如何拆分进行独立编译?
    梯度下降优化算法
    Google大脑科学家贾杨清(Caffe缔造者)-微信讲座
    Jeecg 如何执行批量insert或者update操作,高效率
    【JEECG_3.7.1】列表多表头的设计
    t:formvalid中定义callback函数
    Excel导入的时候日期格式会变成double式的String数据处理
    sql 跨表修改的方式
    js判断字符串str是否包含字符串substr
    帆软报表和jeecg的进一步整合--ajax给后台传递map类型的参数
  • 原文地址:https://www.cnblogs.com/stepping/p/6401148.html
Copyright © 2011-2022 走看看