hdu1969之二分查找
来源:互联网 发布:软件下载万一网 编辑:程序博客网 时间:2024/06/06 02:56
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2735 Accepted Submission(s): 1052
Problem Description
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
Input
One line with a positive integer: the number of test cases. Then for each test case:
---One line with two integers N and F with 1 <= N, F <= 10 000: the number of pies and the number of friends.
---One line with N integers ri with 1 <= ri <= 10 000: the radii of the pies.
---One line with two integers N and F with 1 <= N, F <= 10 000: the number of pies and the number of friends.
---One line with N integers ri with 1 <= ri <= 10 000: the radii of the pies.
Output
For each test case, output one line with the largest possible volume V such that me and my friends can all get a pie piece of size V. The answer should be given as a floating point number with an absolute error of at most 10^(-3).
Sample Input
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2
Sample Output
25.13273.141650.2655
分析:求出每块饼的面积s[i],并记录面积最大的s[i]为maxs,然后在0~maxs之间进行二分得到mid,判断是否每个人都能得到面积为mid的饼,如果能则mid=left,否则right=mid
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<queue>#include<algorithm>#include<map>#include<cmath>#include<iomanip>#define INF 99999999using namespace std;const int MAX=10000+10;const double PT=3.14159265358979323846;double s[MAX];int t,n,m;bool search(double v){int sum=0;for(int i=0;i<n;++i){sum+=(int)(s[i]/v);}if(sum>=m)return true;else return false;} int main(){cin>>t;while(t--){cin>>n>>m;++m;double maxs=-INF,mins=0,mid=0;for(int i=0;i<n;++i){cin>>s[i];s[i]=PT*s[i]*s[i];maxs=max(maxs,s[i]*1.0);}while(fabs(mins-maxs)>1e-6){mid=(mins+maxs)/2;if(search(mid))mins=mid;else maxs=mid;}cout<<fixed<<setprecision(4)<<mid<<endl;}return 0;}
- hdu1969之二分查找
- 二分查找 hdu1969 pie
- HDU1969 PIE 二分查找
- hdu1969 Pie 二分
- hdu1969(pie二分)
- HDU1969---Pie 二分
- HDU1969:Pie(二分)
- hdu1969 Pie 二分
- hdu1969 Pie(二分答案)
- HDU1969 Pie(二分搜索)
- hdu1969 pie【二分】
- hdu1969(二分)
- hdu1969 Pie (二分)
- HDU1969:Pie(二分)
- Hdu1969-Pie-【二分】
- poj 3122&&hdu1969 Pie(二分)
- 【hdu1969】Pie——二分
- HDU1969:Pie(二分 + 贪心)
- OpenGL中的颜色、光照和材质(六)——某个光照方案
- 字节流和字符流区别
- 黑马程序员----JAVA基础2
- C# .Net 多进程同步 通信 共享内存 内存映射文件 Memory Mapped
- cortex-A8上3G模块的支持
- hdu1969之二分查找
- C语言通讯录管理系统
- 黑马程序员---JAVA基础3
- 程序员求职之道(《程序员面试笔试宝典》)之学业与求职,孰轻孰重?
- jpa 多表查询,转载留底学习
- 随机生成100万个数,排序后保存在文件中
- 黑马程序员---JAVA基础4
- Nagios学习
- 微博营销中的 KOL 分析