去年成都赛区的一道题目,画几个图能YY出事凸函数,接着就是三分解
#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
const int N = 10002;
const double eps = 1e-10;//开成-8就错了
struct point
{
double a, b, c;
}node[N];
int n;
double cal(int i, double x)
{
return node[i].a * x * x + node[i].b * x + node[i].c;
}
double check(double mid)
{
double rmin = -2147483640;
for(int i = 0; i < n; i++)
{
rmin = max(rmin, cal(i, mid));
}
return rmin;
}
void find()
{
double l = 0.000000, r = 1000.000000;
while(l + eps < r)
{
double mid = (l + r) / 2;
double midmid = (mid + r) / 2;
double h1 = check(mid);
double h2 = check(midmid);
if(h1 > h2)//找最小的
{
l = mid;
}
else
{
r = midmid;
}
}
double ans = check(l);
printf("%0.4lf\n", ans);
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
scanf("%d", &n);
for(int i = 0; i < n; i++)
scanf("%lf%lf%lf", &node[i].a, &node[i].b, &node[i].c);
find();
}
return 0;
}