传送门:
1064 Cable master
(挑战程序设计竞赛--练习)
题意:有N条绳子,长度分别为 Li, 从它们中切割出K条长度相同的绳子,求这 K 条绳子每条最长能有多长?
分析:设最长为x,则x满足条件:
问题便转化为寻找到这样一个
满足上述条件的
x,这可以用二分搜索来寻找,搜索区间为 [0, max(Li) + c],c为任意常量,只要保证大于 max(Li)。每次迭代都会缩小解的范围,迭代一定次数后,便可以得到精确解。
# include <iostream>
# include <cstdio>
# include <cmath>
# include <algorithm>
using namespace std;
const int maxn = 10000 + 5;
const int INF = 100000 + 10;
int n, k;
double L[maxn];
bool enough(double x)
{
int num = 0;
for(int i = 0; i < n; ++i)
{
num += (int)(L[i] / x);
}
return num >= k;
}
void solve()
{
double left = 0, right = INF;
for(int i = 0; i < 100; ++i)
{
double mid = (left + right) / 2;
//cout << mid << endl;
if(enough(mid)) left = mid;
else right = mid;
}
printf("%.2f\n", floor(right * 100) / 100);
}
int main()
{
while(cin >> n >> k)
{
for(int i = 0; i < n; ++i)
{
scanf("%lf", L + i);
}
solve();
}
return 0;
}