如题:http://poj.org/problem?id=1064
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 25713 | Accepted: 5528 |
Description
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
Output
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
题目大意:意思很简单,给出N个绳子和他们的长度,要求切成K个长度一致的绳子,问满足条件的最大长度能是多少
思路:二分搜索,初始左端点0,右端点绳子的总长,最终找到满足条件的,注意精度的把我很重要,通过循环次数100次来使范围足够小。
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
double L[10005];
int N,K;
int C(double x)
{
int num=0;
int i;
for(i=1;i<=N;i++)
num+=(int)(L[i]/x);
return num>=K;
}
int main()
{
//freopen("C:\\1.txt","r",stdin);
cin>>N>>K;
int i;
double rb=0;
double lb=0;
for(i=1;i<=N;i++)
{
scanf("%lf",&L[i]);
rb+=L[i];
}
for(i=0;i<100;i++)
{
double mid=(lb+rb)/2;
if(C(mid))
lb=mid;
else
rb=mid;
}
printf("%.2f\n",(floor)(lb*100)/100);
}