HDU 1551(搜索题,二分)
2010-07-26 12:57
387 查看
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 257 Accepted Submission(s): 72
Problem Description
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was decided to connect computers for the contestants using a "star" topology - i.e. connect them all to a single central hub. To organize a truly honest contest, the Head of the Judging Committee has decreed to place all contestants evenly around the hub on an equal distance from it.
To buy network cables, the Judging Committee has contacted a local network solutions provider with a request to sell for them a specified number of cables with equal lengths. The Judging Committee wants the cables to be as long as possible to sit contestants as far from each other as possible.
The Cable Master of the company was assigned to the task. He knows the length of each cable in the stock up to a centimeter, and he can cut them with a centimeter precision being told the length of the pieces he must cut. However, this time, the length is not known and the Cable Master is completely puzzled.
You are to help the Cable Master, by writing a program that will determine the maximal possible length of a cable piece that can be cut from the cables in the stock, to get the specified number of pieces.
Input
The input consists of several testcases. The first line of each testcase contains two integer numbers N and K, separated by a space. N (1 ≤ N ≤ 10000) is the number of cables in the stock, and K (1 ≤ K ≤ 10000) is the number of requested pieces. The first line is followed by N lines with one number per line, that specify the length of each cable in the stock in meters. All cables are at least 1 centimeter and at most 100 kilometers in length. All lengths in the input are written with a centimeter precision, with exactly two digits after a decimal point.
The input is ended by line containing two 0's.
Output
For each testcase write to the output the maximal length (in meters) of the pieces that Cable Master may cut from the cables in the stock to get the requested number of pieces. The number must be written with a centimeter precision, with exactly two digits after a decimal point.
If it is not possible to cut the requested number of pieces each one being at least one centimeter long, then the output must contain the single number "0.00" (without quotes).
Sample Input
4 11 8.02 7.43 4.57 5.39 0 0
Sample Output
2.00与HDU1969的思路是一样的~#include <iostream> #include <math.h> using namespace std; #define N 10005 #define EPS 1e-10 double elem ; int n,m; int judge(double x) { int i; int count=0; for(i=0;i<n;i++) { count+=(int)(elem[i]/x); } if(count>=m) return 1; else return 0; } int main() { int i; double MAX=0,low,high,mid; while(scanf("%d%d",&n,&m),m+n) { for(i=0;i<n;i++) { scanf("%lf",&elem[i]); MAX+=elem[i]; } MAX/=m; low=0; high=MAX; while(fabs(low-high)>EPS) { mid=(low+high)/2; if(judge(mid)==1) low=mid; else high=mid; } printf("%.2lf/n",low); } return 0; }
相关文章推荐
- Poj 1064 && Hdu 1551 Cable master【二分搜索】
- HDU 6041 I Curse Myself(二分+搜索)
- HDU - 2141:Can you find it?(二分搜索)
- hdu 1075 二分搜索
- HDU-1969(二分搜索)
- HDU 1969(搜索题,二分)
- hdu 2141 二分搜索
- hdu 1075 二分搜索
- hdu-2141Can you find it?(二分搜索求和)
- HDU 1551 Cable master 二分
- HDU 3681 Prison Break 二分+搜索 The 35th ACM-ICPC Asia Regional Contest (Hangzhou)
- hdu 2199 Can you solve this equation?(二分搜索)
- HDU 5289 Assignment [RMQ区间查询+二分搜索]
- [置顶] HDU 二分搜索 题解目录
- hdu 1551(二分)
- hdu2199 二分搜索
- HDU 5652 India and China Origins 二分+搜索
- 2-sat+二分搜索hdu(3622)
- HDU 2199(搜索题,二分)
- hdu 1795(欧拉函数+二分搜索)