HDU3714:Error Curves(三分)
来源:互联网 发布:树上10只鸟 程序员 编辑:程序博客网 时间:2024/06/02 11:42
Error Curves
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5434 Accepted Submission(s): 2054
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?
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
212 0 022 0 02 -4 2
Sample Output
0.00000.5000
Author
LIN, Yue
Source
2010 Asia Chengdu Regional Contest
题意:n个开口向上的二次函数,在1~1000内取一个数使得所有二次函数中的最大值最小。思路:三分即可,精度设置高一点。
# include <iostream># include <cstdio># include <cmath># include <algorithm># define LL long long# define INF 0x3f3f3f3f# define MAXN 10000using namespace std;double a, b, c, aa[MAXN+1], bb[MAXN+1], cc[MAXN+1];int t, n;double fun(double x){ double ans = -(double)INF; for(int i=0; i<n; ++i) ans = max(ans, aa[i]*x*x+bb[i]*x+cc[i]); return ans;}int main(){ scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0; i<n; ++i) scanf("%lf%lf%lf",&aa[i],&bb[i],&cc[i]); double l=0, r=1000, mid, midmid; while(r-l>1e-9) { mid = (l+r)/2; midmid = (mid+r)/2; if(fun(midmid) > fun(mid)) r = midmid; else l = mid; } printf("%.4f\n",fun(r)); } return 0;}
0 0
- HDU3714:Error Curves(三分)
- hdu3714 Error Curves---三分复习
- 三分搜索--hdu3714 Error Curves
- HDU3714(Error Curves)三分求二次函数的极值
- HDU3714 Error Curves
- LA5009 Error Curves(三分)
- HDU3714 Error Curves (单峰函数)
- 三分(hdu3714)
- hdu 3714 Error Curves(三分)
- Uva - 1476 - Error Curves(三分)
- HDU 3714 Error Curves(三分)
- UVA - 1476 Error Curves (三分搜索)
- hdu 3714 Error Curves(三分)
- POJ 3714 Error Curves(三分)
- HDU 3714 Error Curves(三分查找)
- HDU 3714 Error Curves(三分)
- HDU 3714 Error Curves(三分)
- HDU 3714 Error Curves(三分+模拟)
- go windows下的安装和hello,world
- 在使用WebView时,保存上次阅读位置。
- call()、apply()
- (4)spring boot热部署实现
- 深入理解JVM 一内存
- HDU3714:Error Curves(三分)
- HOJ 2200
- 嵌入式面试题——ARM面试题(三)
- Angular企业级开发(8)-控制器的作用域
- 大数据平台cloudera manager安装
- C语言perror( )函数
- 设计模式之桥接模式
- Java集合
- 【LEETCODE】 Find Largest Value in Each Tree Row javascript实现