刚做这题时我没想到用二分,反而注意力集中到了多人分一个蛋糕该蛋糕应平分这一点上,这样一想就比较麻烦了,之后才得知应算出最大可能蛋糕体积,然后再用二分精确范围。
#include <stdio.h>
#include <math.h>
#define PI acos(-1.0)
#define MAXN 10001
double s[MAXN];
int n,f;
double binsearch(double high,double low);
int isviable(double);
int main()
{
int t;
int i;
double sum,r;
scanf("%d",&t);
while(t--) {
scanf("%d%d",&n,&f);
sum = 0;
for(i = 0; i < n; i++) {
scanf("%lf",&r);
s[i] = PI * r * r;
sum += s[i];
}
printf("%.4lf\n",binsearch(sum / (f+1),0.0)); /*贪心*/
}
return 0;
}
double binsearch(double high,double low)
{
double val;
if(n == 1)
return high;
while(high - low > 1e-6) { /* 控制精度进行查找*/
val = (high + low) / 2;
if(isviable(val))
low = val;
else
high = val;
}
return low;
}
int isviable(double val)
{
int i;
int cnt = 0;
for(i = 0; i < n; i++)
cnt += (int)(s[i] / val);
return cnt > f ? 1 : 0;
}