HDU 1969 Pie
题意:给N个派,分成F+1份,N个派的半径可以不同但厚度均为1,分的时候形状可以不同但体积一样,每一分一定是独立的即不能使几块拼在一起的,问满足分发的一份的最大体积。
思路:用二分法找到这个体积,因为每一块都是独立的,故可以设一个isValid函数判断其分法是否合理。
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <list>
#include <stack>
#include <deque>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
#define debug(x) cout << "--------------> " << x << endl
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-10;
const long long INF = 0x7fffffff;
const long long MOD = 1000000007;
const int MAXN = 10000 + 7;
double V[MAXN];
int N, F;
bool isValid(double x)
{
int num = 0;
for(int i = 0; i < N; ++i)
num += int(V[i] / x);
if(num >= F)
return true;
return false;
}
int main()
{
int T;
scanf("%d", &T);
double totalV = 0;
while(T--)
{
totalV = 0;
memset(V, 0, sizeof(V));
scanf("%d%d", &N, &F);
F++;
for(int i = 0; i < N; ++i)
{
double r;
scanf("%lf", &r);
V[i] = PI*r*r*1.0;
totalV += V[i];
}
double l = 0, r = totalV, mid;
while(r - l > eps)
{
mid = (l + r) / 2.0;
if(isValid(mid))
l = mid;
else
r = mid;
}
printf("%.4f\n", mid);
}
return 0;
}