HDU1551(二分)
来源:互联网 发布:淘宝极速退款没了 编辑:程序博客网 时间:2024/05/16 07:36
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1247 Accepted Submission(s): 457
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.
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.
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).
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 118.027.434.575.390 0
Sample Output
2.00
//二分法,从0到sum/k逐步二分逼近区间答案
#include<iostream>
#include<iostream>
using namespace std;
const double MSM=1e-3;
double len[10000+10];
int n,k;
bool Judge(double mid)
{
int i;
int num=0;
for(i=0;i<n;i++)
{
num+=int(len[i]/mid);
}
return num<k;
}
int main()
{
int i;
double sum;
while((~scanf("%d%d",&n,&k))&&!(0==n&&0==k))
{
sum=0;
for(i=0;i<n;i++)
{
scanf("%lf",&len[i]);
sum+=len[i];
}
double low=0;
double high=sum/k;
double mid;
// cout<<low<<" "<<high<<endl;
while(high-low>MSM)
{
mid=(high+low)/2;
if(Judge(mid))
high=mid;
else
low=mid;
}
printf("%.2lf\n",mid);
}
return 0;
}
- HDU1551(二分)
- hdu1551 二分
- HDU1551:Cable master(二分)
- hdu1551 简单二分
- HDU1551:Cable master(二分)
- HDU1551 Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- Cable master(hdu1551,二分查找)
- hdu1551-二分&细节-Cable master
- hdu1551
- hdu1551
- HDU1551
- 二分——HDU1551:Cable master (精度控制)
- hdu1551 Cable master
- Cable master--hdu1551(二分法)
- HDU1551&&HDU1064 Cable master
- 黑马程序员--java堆栈常量池
- Ubuntu下安装JDK1.7
- Tomcat 7中修改用户名密码
- C++虚函数与纯虚函数用法与区别
- 【字体在哪个文件夹】Win7怎么安装字体
- HDU1551(二分)
- 【高手分享】全方面了解Win7系统的虚拟内存
- Eclipse快捷键
- 第九次c语言上机操作
- C语言字符串转数值
- Cocos2D HTML5 教程系列1: 项目配置和启动
- linux中getopt的用法
- flex 菜单栏 create menu for flex
- 黑马程序员---java基础语法