2010成都站F题 三分
来源:互联网 发布:软件翻译工具 编辑:程序博客网 时间:2024/06/11 03:45
http://acm.hdu.edu.cn/showproblem.php?pid=3714
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
给定多个二次函数保证开口向上,求在0~1000里面取一个数,使得所有二次函数中的最大值最小,求这个最小值。
解题思路:求一个单调函数的值我们用二分,同样的在求二次函数的极值点的时候我们用的是三分。
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int n;double a[10005],b[10005],c[10005];double judge(double x){ double maxx=-0x3f3f3f3f; for(int i=0; i<n; i++) { double cnt=a[i]*x*x+b[i]*x+c[i]; if(maxx<cnt) maxx=cnt; } return maxx;}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.0,r=1000.0; while(r-l>1e-9) { double mid=(l+r)/2; double midmid=(mid+r)/2; if(judge(mid)<judge(midmid)) r=midmid; else l=mid; } //printf("%lf\n",r); printf("%.4lf\n",judge(r)); } return 0;}
0 0
- 2010成都站F题 三分
- 2013成都站F题||hdu4786 并查集 生成树
- 13 成都 F
- hdu 4786 Fibonacci Tree (2013ACMICPC 成都站 F)
- 2010成都站c题||uvalive5006 二进制
- ICPCCamp2017 Day 4 F Factory(三分套三分)
- HDU 4786 Fibonacci Tree (2013ACMICPC 成都站 F) 并查集
- hdu 4734 F(x) (2013成都网络赛G题)(数位DP)
- HDU_4786_Fibonacci Tree(并查集、生成树、斐波那契)(13成都现场F题)
- HDU 4786 Fibonacci Tree 最小生成树 + 最大生成树 (2013成都区域赛 F题)
- GYM 100971 F.Two Points(三分)
- Codeforces 818F Level Generation(三分)
- 2013成都站 H题||hdu 4788
- 2013成都站J题||hdu4790 数论
- HDU 4734 F(x) 2013 ACM/ICPC 成都网络赛
- ~~~~2013成都网赛f(x) hdu4734 数位dp~~~~
- YT14-HDU-三分查找求F(x)的最小值
- IX Samara Regional Intercollegiate Programming Contest F 三分
- 从零开始学android<gallery拖拉组件.二十七.>
- 弹出模式窗口拖动层
- 迷宫题
- fgetc与fputc函数
- 仙境传说-按键精灵脚步研究
- 2010成都站F题 三分
- IP & subnet
- 一张图看 android 事件分发
- 子典树学习——找最多字符串
- 数据库—SQL—基础整理
- POJ1201Intervals差分约束入门
- poj 2186 Popular Cows tarjan
- hdu 3846 RMP
- poj 1458 Common Subsequence