POJ 3122/HDU 1969-Pie-二分法分馅饼
来源:互联网 发布:h3c路由器开放端口 编辑:程序博客网 时间:2024/05/16 05:59
问题及代码:
运行结果:
二分法。
Pie
Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 3 Accepted Submission(s) : 2
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
/* *Copyright (c)2015,烟台大学计算机与控制工程学院 *All rights reserved. *文件名称:HDU.cpp *作 者:单昕昕 *完成日期:2015年3月2日 *版 本 号:v1.0 */ #include<iostream>#include<stdio.h>#include<cmath>using namespace std;const double eps=1e-8;const double PI=acos(-1.0);int main(){ int t; cin>>t; while(t--) { int n,f,i,sum; double s[10000],min=0.0,max=0.0,mid; cin>>n>>f; f++; for(i=0; i<n; i++) { cin>>s[i]; s[i]*=s[i]; if(s[i]>max) max=s[i]; } while(max-min>eps) { mid=(max+min)/2; sum=0; for(i=0; i<n; i++) sum+=s[i]/mid; if(sum<f) max=mid; else min=mid; } printf("%.4lf\n",PI*mid); } return 0;}
运行结果:
二分法。
学习心得:
先找出上下界,下界为0,上界是n个pie中尺寸最大的那个,即每个人得到整个pie,而且是最大的那个。
不断二分,若求出的人数大于f+1,说明现在分得的pie小了,更改min值,否则,更改max值。
0 0
- POJ 3122/HDU 1969-Pie-二分法分馅饼
- HDU 1969 Pie 二分法分蛋糕
- Pie(poj 3122)二分法
- HDU 1969:Pie【二分法】
- HDU-1969 PIE 二分法
- 二分法入门Poj 3122-Pie
- poj 3122 Pie(二分法)
- poj 3122 hdu 1969 Pie
- PIE(二分法分饼)
- hdu 1969 &&nyoj 1193 Pie【二分法】
- hdu 1969 Pie (二分法+贪心)
- hdu 1969 二分法分蛋糕
- HDU 1669 & poj 3122 pie
- hdoj 1969 pie【二分法】
- YT15-HDU-分pie
- 二分法-Pie
- 二分法--Pie
- hdoj 1969 (poj 3122&&acm)Pie
- 第一章 Introduction
- http://bbs.csdn.net/topics/390950357
- session什么时候被创建
- Mac 上安装 Docker后启动boot2docker失败的问题
- hdu 1754 线段树单点修改+区间查询
- POJ 3122/HDU 1969-Pie-二分法分馅饼
- BZOJ 1199 HNOI 2005 汤姆的游戏 计算几何
- **(leetcode_backtracking,递归) Gray Code
- kafka文档(3)----0.8.2-kafka API(java版本)
- DLL与LIB库文件的生成和使用---C++
- dev软件包
- java CountDownLatch 模拟多并发线程简单例子
- VC6.0不能打开文件和添加文件到工程的解决方法
- 【bzoj1269】【AHOI2006】文本编辑器editor【Splay】