题目:http://acm.hdu.edu.cn/showproblem.php?pid=3714
题意:
对于n个二次函数,求每个二次函数的最大值之中的最小值。
分析:
二次函数的子集仍然为凸性函数,所以可以用三分法求极值。
//题目:HDU 3714
//时间:2015-4-13 13:11
//作者:Miki
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
const double eps=1e-9;
const double MIN=0;
const double MAX=1000;
double p[10000+10][3];
int n;
double Calc(double a)
{
double ans=-1e20;
for(int i=0;i<n;i++)
{
ans=max(ans,a*a*p[i][0]+a*p[i][1]+p[i][2]);
}
return ans;
}
double Solve()
{
//三分
double Left, Right;
double mid, midmid;
double mid_value, midmid_value;
Left = MIN; Right = MAX;
while (Left + eps < Right)
{
mid = (Left + Right) / 2;
midmid = (mid + Right) / 2;
mid_value = Calc(mid);
midmid_value = Calc(midmid);
if (mid_value <= midmid_value)
Right= midmid;
else
Left = mid;
}
return midmid_value;
}
int main()
{
// freopen("in.txt","r",stdin);
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%lf %lf %lf",&p[i][0],&p[i][1],&p[i][2]);
printf("%.4lf\n",Solve());
}
return 0;
}