Pie poj 二分求最大平均值
来源:互联网 发布:淘宝比价软件app 编辑:程序博客网 时间:2024/05/17 06:22
Pie
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11799 Accepted: 4084 Special Judge
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.
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
code:
#include<stdio.h>#include<iostream>#include<math.h>#include<algorithm>#define pi acos(-1.0)#define esp 1e-4int n,f;double p[11000];bool c(double d){ int ans=0; for(int i=0;i<n;i++) ans+=(int)(p[i]/d); if(ans>=f) return true; else return false;}int main(){ int i,t; double pie[11000]; double maxx; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&f); f++; maxx=0.0; for(i=0;i<n;i++) { scanf("%lf",&pie[i]); p[i]=pie[i]*pie[i]*(pi); if(maxx<p[i]) maxx=p[i]; } double lb=0,ub=maxx; double mid; while(ub-lb>esp) { mid=(lb+ub)/2; if(c(mid)) lb=mid; else ub=mid; } printf("%.4lf\n",mid); } return 0;}
0 0
- Pie poj 二分求最大平均值
- poj 3122 Pie 二分(最大化平均值)
- poj 3111 二分求最大化平均值
- poj 3122 Pie (最大化平均值)
- poj2976 二分最大平均值
- POJ 3122 Pie 二分
- POJ 3122 Pie 二分
- poj 3122 Pie (二分)
- Pie - POJ 3122 二分
- POJ 3122 Pie(二分)
- POJ 3122pie(二分)
- POJ 3122 pie 二分
- [poj 3122] Pie 二分
- POJ Pie 3122 (二分)
- poj Pie 二分
- POJ 3122 - Pie(二分)
- poj 2018 斜率DP 求子序列的最大平均值
- 求最大最小及平均值
- [BZOJ1492][NOI2007]货币兑换Cash && CDQ分治+斜率优化
- 【整理】adb命令、adb shell与Linux命令
- android studio 启动问题
- 1051. Pop Sequence (25)
- 嵌入式 详解udev
- Pie poj 二分求最大平均值
- CDilog::DoModal调用失败,原因分析
- 【NOI2007】【BZOJ1492】货币兑换Cash
- 使用cout来进行格式化输出
- 198House Robber
- 网络爬虫初步(一)
- UINavigationController实例之私人通讯录
- 有关Servlet初始化参数的获取方法
- 嵌入式 使用udev高效、动态地管理Linux 设备文件