zoukankan      html  css  js  c++  java
  • poj 3421(三分)

    拿这题来说事:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3421

    ZOJ Problem Set - 3421
    Error Curves
    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    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 minimal which related to multiple quadric functions.

    The new function F(x) is defined as follow:

    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?

    Input

    The input contains multiple test cases. The first line is the number of cases T (T < 100). Each case begins with a number n(n ≤ 10000). Following n lines, each line contains three integers a (0 ≤ a ≤ 100), b (|b| ≤ 5000), c (|c| ≤ 5000), which mean the corresponding coefficients of a quadratic function.

    Output

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

    Sample Input

    2
    1
    2 0 0
    2
    2 0 0
    2 -4 2
    

    Sample Output

    0.0000
    0.5000
    
    有≥1条二次曲线(开口向上)或直线,
    经以下处理:
    有≥1条曲线或直线,对应同一个x值,得到多个S(x)值(即y值),取最大值为F(x)(即新产生的曲线方程的y值)。
    最终得到曲线方程F(x),求F(x)的最小值。
     
    代码
    double Go(void)
    {
    double fLeft, fRight, fRMid, fLMid;
    double fRMidValue, fLMidValue;

    /* x is [0, 1000] */
    fLeft
    = 0;
    fRight
    = 1000;
    while (fRight - fLeft > 1e-8)
    {
    fRMid
    = (fLeft + fRight*2) / 3;
    fLMid
    = (fLeft*2 + fRight) / 3;
    fLMidValue
    = fRMidValue = -1e100;
    for (int i = 0; i < nFun; ++i)
    {
    fRMidValue
    = max(fRMidValue, (fun[i].a*fRMid+fun[i].b)*fRMid+fun[i].c);
    fLMidValue
    = max(fLMidValue, (fun[i].a*fLMid+fun[i].b)*fLMid+fun[i].c);
    }
    /* 重新确定左右界 */
    if (fLMidValue < fRMidValue)
    fRight
    = fRMid;
    else
    fLeft
    = fLMid;
    }

    fLeft
    = (fLeft+fRight)/2; /* F(x)最小时所对应的x值(经三分而得到) */
    fRight
    = -1e100; /* fRight对应的是F(x)的最小值*/
    for (int i = 0; i < nFun; ++i)
    fRight
    = max(fRight, (fun[i].a*fLeft+fun[i].b)*fLeft+fun[i].c);

    return fRight;
    }
  • 相关阅读:
    盛京剑客系列21:再强调一遍:机会在MSCI成份,别走偏了
    盛京剑客系列20:平仓中兴通讯,获利45.51%,继续加仓优质个股
    盛京剑客系列19:推书《战胜华尔街》
    盛京剑客系列18:很多人因为恐惧脚下的小土坑,却丢掉了一米远处的大金矿
    盛京剑客系列17:市场暴跌下投资组合的调整
    盛京剑客系列16:推书《股市稳赚》
    盛京剑客系列15:割韭秘籍
    盛京剑客系列14:对高估值医药股要谨慎
    盛京剑客系列13:披露指数的密码,曙光就在前方
    leetcode -- Longest Valid Parentheses
  • 原文地址:https://www.cnblogs.com/submarinex/p/1941234.html
Copyright © 2011-2022 走看看