zoukankan      html  css  js  c++  java
  • HDOJ 3714 Error Curves

    题目意思很难得懂,给N个2次函数,求最大值中的最小值
    3分法  (用黄金分割比例可以省去一次计算使速度更快)用CIN COUT会超时

    Error Curves

    Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 65536/65536K (Java/Other)
    Total Submission(s) :    Accepted Submission(s) : 
    Problem Description
    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?
     


    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
     


    Author
    LIN, Yue
     


    Source
    2010 Asia Chengdu Regional Contest
     
     1 #include <cstdio>
     2 #include <iostream>
     3 #include <cmath>
     4 
     5 #define eps 1e-9
     6 
     7 using namespace std;
     8 
     9 int a[10030],b[10030],c[10030];   int n;
    10 double s,m1,m2,e;
    11 
    12 double qua(int a,int b,int c,double x)
    13 {
    14     return a*x*x+b*x+c;
    15 }
    16 
    17 
    18 int main()
    19 {
    20 int T;
    21 scanf("%d",&T);
    22 while(T--)
    23 {
    24     scanf("%d",&n);
    25     for(int i=0;i<n;i++)
    26     {
    27         scanf("%d%d%d",&a[i],&b[i],&c[i]);
    28     }
    29 
    30     s=0.;e=1001.;
    31     while(e-s>eps)
    32     {
    33 //        cout<<s<<"...."<<e<<endl;
    34         m1=(s*2+e)/3.;
    35         m2=(s+2*e)/3.;
    36 
    37         double min1=-999999999,min2=-999999999;
    38         for(int i=0;i<n;i++)
    39         {
    40             double ans1=qua(a[i],b[i],c[i],m1);
    41             double ans2=qua(a[i],b[i],c[i],m2);
    42             min1=max(min1,ans1);
    43             min2=max(min2,ans2);
    44         }
    45 
    46         if(min2>=min1)
    47         {
    48             e=m2;
    49         }
    50         else
    51         {
    52             s=m1;
    53         }
    54 
    55     }
    56     double ans=-99999999;
    57     for(int i=0;i<n;i++)
    58     {
    59         ans=max(ans,qua(a[i],b[i],c[i],e));
    60     }
    61     printf("%.4lf\n",ans);
    62 }
    63 
    64     return 0;
    65 }
  • 相关阅读:
    hdu 4324(dfs)
    hdu 2376(求树上任意两点之间距离之和的平均值)
    hdu 3665(最短路)
    hdu 4463(最小生成树变形)
    hdu 2242(边双连通分量)
    hdu 2682(最小生成树)
    hdu 2444(二分图的判断以及求最大匹配)
    陶哲轩实分析命题6.4.12
    陶哲轩实分析习题8.3.4
    CantorBernsteinSchroeder定理的证明
  • 原文地址:https://www.cnblogs.com/CKboss/p/3041056.html
Copyright © 2011-2022 走看看