杭电1551--Cable master（二分 + 精度）

最新推荐文章于 2018-05-17 10:57:53 发布

转载最新推荐文章于 2018-05-17 10:57:53 发布 · 87 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/soTired/p/4692593.html

文章标签：

#java

针对Cablemaster问题，探讨如何从给定长度的电缆中切割出尽可能多的等长线段，以满足特定数量的需求。通过二分查找算法确定最大可能的线段长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Cable master

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2606 Accepted Submission(s): 970

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 | We have carefully selected several similar problems for you: 2333 2298 1399 2446 1969

题意：n段线切成k段（长度相等），求最长长度，二分查找最大长度；

1 1

0.009

#include <cstdio>
using namespace std;
double num[10010]; int i, n, k;
bool f(double x)
{
    int total=0;
    for(int i=0; i<n; i++)
        total += (int)(num[i]/x);
    return total>=k; 
}
int main()
{
    while(scanf("%d%d", &n, &k) != EOF)
    {
        if(n==0 && k==0)
            break;
        double max=-1.0;
        for(int i=0; i<n; i++)
        {
            scanf("%lf", &num[i]);
            if(num[i]>max)
                max=num[i]; 
        }
        double left=0, right=max, mid;
        while(right-left>0.00000001)
        {
            mid=(left+right)/2.0;
            if(f(mid))
                left=mid;
            else
                right=mid;
        }
        if((int)(right*1000)%10>=5)  // 精度
            right-=0.005;                 //不加判断 1 1 1不符合；
        printf("%.2lf\n", right);
    }
    return 0;
}