Poj 3122 Pie 二分+贪心

Pie

My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.

My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.

What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.

思路

贪心+二分。复杂度为O(nlogM)。

初始时，M=high-low，high为每个人分得奶酪的体积sum，low = 0（当然，最小块的奶酪作为low也可以）。

然后二分，每次的mid值为（low+high）/ 2，然后根据mid值遍历n块奶酪，看看这个mid值能分给多少个人，如果份数大于等于f，mid不够，low = mid，反之high = mid。

代码

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int N=10000+5;
int T,n,f;
double pie[N];
double pi=acos(-1.0);
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        double sum=0,mid,low=0,high;
        scanf("%d%d",&n,&f);
        f++;
        for (int i=1;i<=n;i++)
        {
            int r;
            scanf("%d",&r);
            pie[i]=r*r;
            sum+=pie[i];
        }
        high=sum/f;
        while(high-low>0.000001)
        {
            mid=(low+high)/2;
            int tot=0;
            for (int i=1;i<=n;i++)
            tot+=pie[i]/mid;
            if (tot>=f) low=mid;
            else high=mid;
        }
        printf("%.4lf\n",mid*pi);
    }
    return 0;
}