二分搜索--poj1064
2013-09-19 15:53
351 查看
Language:
Default
Cable master
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 18709
Accepted: 4007
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 first line of the input file contains two integer numb ers 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 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.
Output
Write to the output file 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 file must contain the single number "0.00" (without quotes).
Sample Input
Sample Output
Default
Cable master
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 18709
Accepted: 4007
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 first line of the input file contains two integer numb ers 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 meter and at most 100 kilometers in length. All lengths in the input file are written with a centimeter precision, with exactly two digits after a decimal point.
Output
Write to the output file 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 file must contain the single number "0.00" (without quotes).
Sample Input
4 11 8.02 7.43 4.57 5.39
Sample Output
2.00 二分搜索,假定一个值并判断是否可行,其中的for循环用于控制精度。 类似的有些要求输出小数的,二分搜索时要设置合理的结束条件满足精度要求。#include<iostream> #include<cstdio> #include<cmath> using namespace std; double a[10010]; int N,K; bool fun(double mid) { int num=0; for(int i=1;i<=N;i++) num+=a[i]/mid; return num>=K; } int main() { //freopen("in.txt","r",stdin); while(cin>>N>>K) { double maxn=0; for(int i=1;i<=N;i++) { cin>>a[i]; if(a[i]>maxn) maxn=a[i]; } double l=0,r=maxn,mid; for(int i=0;i<100;i++) { mid=(l+r)/2; if(fun(mid)) l=mid; else r=mid; } printf("%.2f\n",floor(l*100)/100); } return 0; }
相关文章推荐
- POJ - 1064 Cable master(二分搜索)
- poj1064 Cable master (二分搜索)
- poj1064 二分搜索 挑战程序设计竞赛
- POJ 1064 Cable master(很好玩的二分搜索)
- POJ 1064 Cable master(很好玩的二分搜索)
- POJ_1064 二分搜索
- POJ_1064 二分搜索
- POJ 1064 1759 3484 3061 (二分搜索)
- poj 1064 Cable master(二分搜索)
- 二分搜索 POJ 1064 Cable master
- poj1064 二分搜索
- POJ 1064 切绳子 二分搜索求一个可行解
- POJ--1064 Cable master(二分搜索)
- poj1064 Cable master(二分搜索)
- Poj 1064 && Hdu 1551 Cable master【二分搜索】
- 《挑战程序设计竞赛》3.1.1 二分搜索-最大化最小值 POJ1064 2456 3258 3273 3104 3045
- POJ 1064 Cable master (二分搜索)
- POJ 1064 Cable master (二分答案,G++不过,C++就过了)
- 【POJ】3122 Pie 二分搜索
- Poj 1064 Cable master(二分