标签：des style http color io os ar for strong
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 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?
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.
For each test case, output the answer in a line. Round to 4 digits after the decimal point.
2 1 2 0 0 2 2 0 0 2 -4 2
0.0000 0.5000
大致题意：给了好多抛物线f(i)的a[i], b[i], c[i], 定义F (i)= max(f(i)) ， 求F(x)在区间【0，1000】上的最小值。
解题思路：由于题中给出的a>=0, 所以a有可能为零，此时曲线为直线，否则曲线为开口向上的抛物线，故为下凸函数，所以F(x)也为下凸函数。故可用三分法求F(x)的极值。先算出F(x)的具体值，然后就可直接三分了。详见代码
AC代码：
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 10000 + 10;
int n, a[maxn], b[maxn], c[maxn];
double f(double x){ //求F(x)
double ans = a[0]*x*x + b[0]*x + c[0];
for(int i=1; i<n; i++){
ans = max(ans, a[i]*x*x+b[i]*x+c[i]);
}
return ans;
}
int main(){
// freopen("in.txt","r",stdin);
int T;
scanf("%d",&T);
while(T--){
scanf("%d", &n);
for(int i=0; i<n; i++)
scanf("%d%d%d", &a[i], &b[i], &c[i]);
double l = 0, r = 1000; //三分求极值
for(int i=0; i<100; i++){
double mid = l + (r-l)/3;
double midmid = r - (r-l)/3;
if(f(mid) < f(midmid)) r = midmid;
else l = mid;
}
printf("%.4lf\n",f(l));
}
return 0;
}
LA 5009 (HDU 3714) Error Curves （三分）
标签：des style http color io os ar for strong
原文地址：http://blog.csdn.net/u013446688/article/details/39753975
