Josephina is a clever girl and addicted to Machine Learning recently. She
pays much attention to a method called Linear Discriminant Analysis, which
has many interesting properties.
In order to test the algorithm’s efficiency, she collects many datasets.
What’s more, each data is divided into two parts: training data and test
data. She gets the parameters of the model on training data and test the
model on test data. To her surprise, she finds each dataset’s test error curve is just a parabolic curve. A parabolic curve corresponds to a quadratic function. In mathematics, a quadratic function is a polynomial function of the form f(x) = ax2 + bx + c. The quadratic will degrade to linear function if a = 0.

It’s very easy to calculate the minimal error if there is only one test error curve. However, there are several datasets, which means Josephina will obtain many parabolic curves. Josephina wants to get the tuned parameters that make the best performance on all datasets. So she should take all error curves into account, i.e., she has to deal with many quadric functions and make a new error definition to represent the total error. Now, she focuses on the following new function’s minimum which related to multiple quadric functions. The new function F(x) is defined as follows: F(x) = max(Si(x)), i = 1…n. The domain of x is 0,1000. Si(x) is a quadric function. Josephina wonders the minimum of F(x). Unfortunately, it’s too hard for her to solve this problem. As a super programmer, can you help her?


The input contains multiple test cases. The first line is the number of cases T (T


For each test case, output the answer in a line. Round to 4 digits after the decimal point.

Sample Input

2 0 0
2 0 0
2 -4 2

Sample Output


题目大意:给定n个函数 f(x)=ax2+bx+c,F(x)=max(Si(x)),i=1…n,F(x)结果保留四位小数。F(x)f(x)[0,1000]线F(x)a>0开口向上,直接三分即可。


using namespace std;
#define eps 1e-9
const int N = 10010;
int a[N], b[N], c[N];
int n;

double fx(double x)
    double ans = a[0] * x*x + b[0] * x + c[0];
    for (int i = 1; i return ans;

int main( )
    int T;
    scanf("%d", &T);
    while (T--)
        scanf("%d", &n);
        for (int i = 0; i scanf("%d%d%d", &a[i], &b[i], &c[i]);
        double l = 0, r = 1000;
        while (r-l>eps)
            double lmid = l + (r - l) / 3;
            double rmid = r - (r - l) / 3;
            if (fx(lmid)else l = lmid;

        printf("%.4lf\n", fx(l));

    return 0;

本博客所有内容采用 知识共享署名-非商业性使用-相同方式共享 4.0 国际许可协议 进行许可

转载文章请注明:HDU 3714 – Error Curves (三分查找) -

分类: Coding





邮箱地址不会被公开。 必填项已用*标注