HDU - Error Curves(三分)

题目传送
三分:

AC代码

#include<bits/stdc++.h>
#include<iostream>
#include<stack>
#include<algorithm>
#include<queue>
#include<deque>
#include<vector>
#include<map>
#include<set>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
inline long long read(){char c = getchar();long long x = 0,s = 1;
while(c < '0' || c > '9') {if(c == '-') s = -1;c = getchar();}
while(c >= '0' && c <= '9') {x = x*10 + c -'0';c = getchar();}
return x*s;}
using namespace std;
#define NewNode (TreeNode *)malloc(sizeof(TreeNode))
#define Mem(a,b) memset(a,b,sizeof(a))
#define lowbit(x) (x)&(-x)
//#define int long long
const int N = 4e6 + 100;
const long long INFINF = 0x7f7f7f7f7f7f7f;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-11;
const int mod = 1e9+7;
const double II = acos(-1);
const double PP = (II*1.0)/(180.00);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> piil;
double a[10005],b[10005],c[10005];
int n;
double solve(double x)
{

    double Max = -INF;
    for(int i = 0;i < n;i++)
        Max = max(Max,a[i]*x*x+b[i]*x+c[i]);
    return Max;
}
double Binary()
{
    double l = 0,r = 1000;
    while(r-l >= EPS)
    {
        double lmid = l + (r-l)/3;
        double rmid = r - (r-l)/3;
        if(solve(lmid) > solve(rmid))
            l = lmid;
        else
            r = rmid;
    }
    return l;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    //    freopen("input.txt","r",stdin);
    //    freopen("output.txt","w",stdout);
    int t;
    scanf("%d",&t);
    while(t--)
    {
        double sum;
        scanf("%d",&n);
        for(int i = 0;i < n;i++)
            scanf("%lf %lf %lf",&a[i],&b[i],&c[i]);
        sum = Binary();
        printf("%.4lf\n",solve(sum));
//        cout << fixed << setprecision(4) << sum << endl;
    }
    return 0;
}