Cable master(hdu1551,二分查找)
来源:互联网 发布:什么微单最好 一款知 编辑:程序博客网 时间:2024/05/29 19:43
http://acm.hdu.edu.cn/showproblem.php?pid=1551
Cable master
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1324 Accepted Submission(s): 491
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
Source
2001-2002 ACM Northeastern European Regional Programming Contest
Recommend
LL
解析:
题意:
将n根网线切成k段相同长度的网线,问可切成的最长长度是多少;
思路:
利用二分发查找答案,每次偏右查找(因为要查找大的)
156MS 316K 978 B C++
#include<stdio.h>#include<string.h>#include<algorithm>#include <iostream>using namespace std;const int maxn=10010;double a[maxn];const double exp=1e-9;int n,k;int check(double m){ int t=0;for(int i=0;i<n;i++){t+=(int)(a[i]/m);}if(t>=k)return 1;elsereturn 0;}int main(){ int i,j; double ans,s; while(scanf("%d%d",&n,&k)!=EOF){ if(n==0&&k==0) break; s=0.0; for(i=0;i<n;i++) {scanf("%lf",&a[i]); s+=a[i]; } double l,r; double mid; ans=0.0; l=0; r=s; while(r-l>exp)//注意精度问题 { mid=(l+r)/2; if(check(mid)) { ans=mid; l=mid; } else r=mid; } printf("%.2lf\n",ans);} return 0;}
- Cable master(hdu1551,二分查找)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551 Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- HDU1551:Cable master(二分)
- hdu1551-二分&细节-Cable master
- hdu1551 Cable master
- Cable master--hdu1551(二分法)
- HDU1551&&HDU1064 Cable master
- 二分——HDU1551:Cable master (精度控制)
- Cable master(二分查找)
- HDOJ 1551 Cable master(二分查找)
- POJ 1064 Cable master(二分查找)
- POJ1064 Cable master(二分查找)
- Cable master(二分查找解)
- POJ 1064Cable master(二分查找)
- C# 自定义格式化字符串说明符
- delphi RegisterHotKey注册快键
- 华为心得
- phpcms中的$CATEGORY 数组
- SharedPreferences 的用法
- Cable master(hdu1551,二分查找)
- Gerrit 管理下git库分支导入
- getting start with storm 翻译 第六章 part-3
- ARC简介以及工程中ARC与非ARC的混合
- Design T-Shirt(hdu1031,简单排序)
- phpcms v9 如何获取当前栏目的名?
- netpoll浅析
- Android手机利用USB共享网络通过Ubuntu连接网络
- xss绕过过滤方法分享 及有关web攻击的方法