Error Curves
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
题意:给n个二次函数f(x),定义F(x)=max(f(x)),即n个二次函数中的最大值。求F(x)在区间[1,1000]内的最小值。
根据题意可以知道,F(x)是单峰函数。于是我们可以三分解决。对于区间[L,R],找它的三等分点M1,M2,如果F(M1)<F(M2),则答案在[L,M2],否则在[M1,R]。
https://blog.csdn.net/talak/article/details/7947029
第一次做三分题,记录一下
#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <cstdio>
using namespace std;
const int N = 1e4 + 7;
double
a[N], b[N], c[N];
int n;
double f(double 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() {
int t;
scanf ("%d", &t);
while (t--) {
scanf ("%d", &n);
for (int i = 0; i < n; ++i) {
scanf ("%lf %lf %lf", &a[i], &b[i], &c[i]);
}
double l = 0, r = 1000;
while (fabs(r - l) > 1e-9) {
//double mid1 = (r + l)/2.0;
//double mid2 = (mid1 + r)/2.0;
double mid1 = l + (r - l)/3.0; // 快一丁丁
double mid2 = r - (r - l)/3.0;
if (f(mid1) < f(mid2)) {
r = mid2;
} else {
l = mid1;
}
}
printf ("%.4lf\n", f(l));
}
return 0;
}