poj1064 Cable master

Cable master

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 43071		Accepted: 9220

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

Source

Northeastern Europe 2001

二分

题意：给出n条线段，以米的单位给出，小数点后两位（精确到厘米），要你对这些线段裁剪，裁剪出m条等长的线段，并且让这些线段尽可能长另外线段的长度不能小于1厘米，如果筹不够m条，输出0.00

做法就是二分答案，但是二分的区间有讲究

一开始我认为长度的上限应该是  min { len[i] }，即最短的那条线段，后来才想到是错的，应该是max{ len[i] }，因为有一点想当然了，认为裁剪线段，就是每条线段都要裁剪，其实不是的，并不是每条线段都要裁剪

好像

4 2

2.00

3.00

4.00

答案是2.00吗？不是的，应该是3.00，虽然3.00大于第一条线段的长度，那么就不要裁剪第1条线段，直接从第2，第3条线段开始裁剪，就能裁剪出2条3.00长度的线段

 

另外，这题可以用浮点数的二分来写，但是基于题目的意思，完全可以转化为整数

因为最后长度不能小于1厘米，而一开始给出的线段也是精确到厘米的，而答案也是要求精确到厘米的，那么为什么我们不一开始就把所有的数据都改成用厘米来表示呢？然后直接用整数来二分就可以避免掉所有精度的问题。所以一开始的二分区间就是[1,max{len[i]}] , 不要从0开始，完全没有比较，因为答案最小要为1

最后一点，也是wa的地方，想了一阵子想明白了

我们二分答案，得到一个长度l，然后用所有线段去除l，看能裁剪出多少条，然后统计条数的总和count

然后就分类

count < m，说明这个长度l太长，筹不够m条，所以要缩点长度l，去左半区间二分

count = m，说明是一个合法的答案，记录，但是这样就可以了吗?可以跳出了吗？不是的，因为要找最大值，所以不能跳出，继续到右半区间二分

count > m , 这是不是一个合法的答案？一开始没想清楚，认为不是合法的答案，其实是的！另外要到右半区间继续二分找一个更大的值

 

下面的这个二分是错误的，就是因为count和m的判断出错

首先count>m的情况是一个合法的答案，最要命的是，可能找不到满足条件的count == m，这能找到count > m

例如

3 5

3.00

3.00

3.00

答案是1.00，当答案是1.00的时候count=9 > 5 , 当答案为2,3的时候，count都无法等于m，根本无法更新答案

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
#define N 10010
#define MAX 10000000
int a[N];
int main()
{
    int n,m;
    double len;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        int Max=0;
        for(int i=0;i<n;i++)
        {
            scanf("%lf",&len);
            a[i]=len*100;//转化为整数
            Max=max(Max,a[i]);//找出最大的绳子
        }
        int low=1,high=Max;//因为长度不能小于1，所以左区间从1开始，有区间从最大的开始
        int res=0;
        while(low<=high)
        {
            int mid=(low+high)/2;//平均绳子长度
            int cout=0;//记录剪了多少段绳子
            for(int i=0;i<n;i++)
            {
                cout+=a[i]/mid;
            }
            if(cout>=m)//说明绳子多，还可以再长
                       //表示绳子平均长度还可以再长
            {
                res=max(res,mid);
                low=mid+1;
            }
            else//说明绳子少，还要再短
                    //表示绳子平均长度还要再短
            {
                high=mid-1;
            }
        }
        printf("%.2f\n",(double)res/100.0);
    }
}