Strange fuction(poj 2899)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9102 Accepted Submission(s): 6198
Problem Description
Now, here is a fuction:
F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 <= x <=100)
Can you find the minimum value when x is between 0 and 100.
Input
The first line of the input contains an integer T(1<=T<=100) which means the number of test cases. Then T lines follow, each line has only one real numbers Y.(0 < Y <1e10).
Output
Just the minimum value (accurate up to 4 decimal places),when x is between 0 and 100.
Sample Input
2
100
200
Sample Output
-74.4291
-178.8534
别人的解题思路:
解题思路:
首先求导的导函数为:
G(x)=42*x^6+48*x^5+21*x^2+10*x-y(0<=x<=100)
令G(x)=0得
y=42*x^6+48*x^5+21*x^2+10*x
此函数很明显是一个单调递增的函数。
由此可知若导函数的最大值小于0,那么原函数在区间内单调递减。即当x=100时最小;
若函数的最小值大于0,那么原函数在区间内单调递增,即当x=0时最小。
若导函数既有正又有负又由于导函数是单增函数,所以必有先负后正,即原函数必有先减后增的性质,再用二分的方法求出导函数的零点也就是原函数的最小值点,最后带入求解。
思路:
这个题是叫我们求最小值,那么很明显对于函数求最值,最简单的方法就是求导
我们对f(x)求导之后得到:f'(x)=42*x^6+48*x^5+21*x*x+10x-y
很明显,当f'(x)=0时取得最值,然后由于定义域x属于[0,100]那么可以推断,f'(x)=0时
f(x)有最小值。
我们可以利用二分算法去计算f'(x)=0时x为多少(注意f'(x)是单调递增的)
计算出x之后再代入原函数解出最小值即可。
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#define inf 1e10
using namespace std;
double F1(double x)
{
return 42*pow(x,6)+48*pow(x,5)+21*pow(x,2)+10*x;//求导后=0就是最值
}
double F2(double x,double y)
{
return 6*pow(x,7)-y*x+8*pow(x,6)+7*x*x*x+5*x*x;
}
int main(void)
{
double y,x;
int t,i;
scanf("%d",&t);
while(t--)
{
scanf("%lf",&y);
double left=0,right=100;
for(i=0;i<=100;i++)
{
x=(left+right)/2;
if(F1(x)>y)
right=x;
else if(F1(x)<y)
left=x;
else
break;
}
printf("%.4lf\n",F2(x,y));
}
return 0;
}
求导、拆项。