题目:
http://poj.org/problem?id=1064
题意:
给n段绳子和各自的长度,长度均精确到小数后两位,现在把n段绳子切成k段等长的绳子,求最大长度
思路:
二分答案,枚举长度,判断能否切成k段。这个题精度问题真是一大坑点,因为长度均精确到小数后两位,于是可以把所有绳子扩大100倍为整数,然后去做,这样就可以避免精度问题。直接用浮点数去二分的话,注意精度,另外注意输出的时候是直接截断后面的小数,不是四舍五入
扩大100倍为整数
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
const int N = 10010, INF = 0x3f3f3f3f;
const double eps = 1e-4;
double arr[N];
int brr[N];
int n, k;
int work(int mid)
{
int sum = 0;
for(int i = 1; i <= n; i++)
sum += brr[i] / mid;
return sum;
}
int main()
{
while(~ scanf("%d%d", &n, &k))
{
int res = 0;
for(int i = 1; i <= n; i++) scanf("%lf", &arr[i]), brr[i] = arr[i] * 100;
int l = 1, r = 10000000;
while(l <= r)
{
int mid = (l + r) / 2;
int tmp = work(mid);
if(tmp >= k) res = mid, l = mid + 1;
else r = mid - 1;
}
printf("%.2f\n", res / 100.0);
}
return 0;
}
直接二分小数
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
const int N = 10010, INF = 0x3f3f3f3f;
double arr[N];
int n, k;
int work(double mid)
{
int sum = 0;
for(int i = 1; i <= n; i++)
sum += arr[i] / mid;
return sum;
}
int main()
{
while(~ scanf("%d%d", &n, &k))
{
double res = INF;
for(int i = 1; i <= n; i++) scanf("%lf", &arr[i]);
double l = 0.0, r = 100000.0;
for(int i = 1; i <= 100; i++)
{
double mid = (l + r) / 2;
int tmp = work(mid);
if(tmp >= k) res = mid, l = mid;
else r = mid;
}
printf("%.2f\n", floor(res*100) / 100);//不用floor函数是四舍五入,用了是直接截断
}
return 0;
}