POJ_Cable_master_1064
这个题简直搞死我了,昨天弄了一天,今天才把一个不知道算不算错误的错找出来
最开始输出语句为:
printf("%.2lf\n", binary_search(max));
结果今天才发现错误是不能用%lf,要用%f
我寻思着double类型不应该用%lf输出吗
经过搜索查找资料发现
double类型输入用%lf,输出用%f
CPlusPlus上没有%lf的定义,简直暴毙。。。
printf("%.2f\n", binary_search(max));
另外一点,对于精度的把握可以通过如下实现:
if (isEnough(begin + 0.01))
begin += 0.01;
return begin;
源代码
#include<stdio.h>
#define MAX_N 10000
#define MAX(x,y) x>y?x:y
int N;
int K;
double length[MAX_N];
double binary_search(double end);
bool isEnough(double length);
int main() {
scanf("%d %d", &N, &K);
double max = 0.0;
for (int i = 0; i < N; i++) {
scanf("%lf", length + i);
max = MAX(max, length[i]);
}
printf("%.2f\n", binary_search(max));
return 0;
}
double binary_search(double end) {
double begin = 0.0;
while ((end - begin) > 0.01)
{
double mid = (end + begin) / 2;
if (isEnough(mid))
begin = mid;
else
end = mid;
}
begin = 0.01 * static_cast<int>(begin * 100);
if (isEnough(begin + 0.01))
begin += 0.01;//防止begin不能精确到最大长度,或者结果是end的情况,加一判断
return begin;
}
bool isEnough(double length) {
int m = 0;
for (int i = 0; i < N; i++)
m += static_cast<int>(::length[i] / length);
return m >= K;
}
POJ_Aggressive_cows_2456.cpp
源代码
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include <algorithm>
#define MAX_N 100000
int home[MAX_N];
int N;
int C;
bool isOK(int d);
int main() {
scanf("%d %d", &N, &C);
for (int i = 0; i < N; i++)
{
scanf("%d", home + i);
}
std::sort(home, home + N);
int begin = 1;
int end = (home[N - 1] - home[0]) / (C - 1) + 1;
while ((end - begin) > 1) {
int mid = (begin + ((end - begin) >> 1));
if (isOK(mid))
begin = mid;
else
end = mid;
}
if (isOK(begin + 1))
++begin;
printf("%d\n", begin);
return 0;
}
bool isOK(int d) {
int num = 1;
int loc = home[0] + d;
for (int i = 1; i < N; i++)
if (home[i] >= loc) {
if (++num >= C)
return true;
loc = home[i] + d;
}
return false;
}