Light Bulb-------三分查找
来源:互联网 发布:淘宝主图视频内存大小 编辑:程序博客网 时间:2024/05/22 07:58
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 H, h 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, andH - 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
32 1 0.52 0.5 34 3 4
Sample Output
1.0000.7504.000
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>using namespace std;int main(){ // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); int T; double H,h,D; scanf("%d",&T); while(T--) { scanf("%lf%lf%lf",&H,&h,&D); double temp=sqrt((H-h)*D); double temp2=(H-h)*D/H; if(temp>=D)printf("%.3lf\n",h); else if(temp<temp2)printf("%.3lf\n",h*D/H); else { double ans=D+H-temp-(H-h)*D/temp; printf("%.3lf\n",ans); } } return 0;}
三分法:
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>using namespace std;const double eps=1e-8;double H,h,D,ans;double Cal(double l){return l+D*(h-l)/(H-l);}int main(){ int t;scanf("%d",&t);while(t--){scanf("%lf%lf%lf",&H,&h,&D);double left=0,right=h,mid,midmid;while(right-left>=eps){mid=(left+right)/2;midmid=(mid+right)/2;if(Cal(mid)>Cal(midmid))right=midmid;else left=mid;}printf("%.3lf\n",Cal(left));}return 0;}
- Light Bulb-------三分查找
- ZOJ 3203 Light Bulb 三分查找
- Zoj 3203 Light Bulb (三分查找)
- Light Bulb(三分)
- zoj3203 Light Bulb(三分)
- Light Bulb(三分)
- zoj 3203 Light Bulb(三分)
- zoj3203 Light Bulb-----三分复习
- zoj 3203 - Light Bulb (三分)
- zoj 3366 Light Bulb 三分
- Light Bulb+ZOJ+三分搜索
- ZOJ 3366 - Light Bulb(三分)
- zoj 3203 Light Bulb 三分
- ZOJ 3203 Light Bulb--三分
- 三分 --- ZOJ 3203 Light Bulb
- ZOJ 3203 Light Bulb 三分
- zoj 3203 Light Bulb(三分)
- nyoj Light Bulb(三分方法,公式求解)
- googletest mock设置 编译器选项 vs下
- 搜索算法11之1016
- Shiro入门
- 如何在未知链表中找到一个中间节点
- 异步选择WSAAsyncSelect
- Light Bulb-------三分查找
- crc计算
- xmemcached缓存
- git基础命令整理
- 最长公共子序列(LCS问题)的DP解法
- 【BZOJ3997】组合数学,总之是DP就对了
- 对象实例化---Parcelable接口的使用
- socket中的短连接与长连接,心跳包示例详解
- Redis 安装实例