杭电acm1551二分法

原创于 2018-08-15 20:14:40 发布 · 227 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#杭电1551二分法 #简单二分法

杭电二分法专栏收录该内容

4 篇文章

订阅专栏

本文探讨了Cablemaster面临的电缆切割挑战，旨在确定从现有库存中切割出指定数量电缆的最大可能长度，确保参赛者在编程比赛中保持最大距离。通过二分搜索算法找到最优解。

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

Cable master

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

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

题目大意：给N段不同长度电缆线，要分成K段相同的电缆线，求电缆长度的最大值?（这个题与杭电1969题目相同，做法也一模一样）

分析：首先，求出来二分上线最大长度为（总长/K），然后在进行二分将得到的总段数与K相比较（注意：要转化成int型）

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
double a[10000];
double V,v;
int N,K,num;
double F(double m)
{
    num=0;
    for(int i=0;i<N;i++)
    {
        num+=int(a[i]/m);
    }
    return num;
}
int main()
{
   while(cin>>N>>K&&N!=0&&K!=0)
   {
     V=0;
     for(int i=0;i<N;i++)
     {
        cin>>a[i];
        V+=a[i];
     }
     v=V/K;
     double l=0,r=v,mid;
     while(r-l>1e-8)
     {
        mid=(l+r)/2;
        F(mid);
        if(num<K)
          r=mid;
        else
          l=mid;
     }
     if(mid>=0.1)
       printf("%.2lf\n",mid);
    else
       printf("0.00\n");
   }    
}