搜索算法1之1002

最新推荐文章于 2024-01-20 18:17:05 发布

德国战车E75

最新推荐文章于 2024-01-20 18:17:05 发布

阅读量333

点赞数 1

分类专栏： ACM算法文章标签：搜索算法

本文链接：https://blog.csdn.net/ghost_heng_007/article/details/51149513

版权

ACM算法专栏收录该内容

56 篇文章 0 订阅

订阅专栏

1 题目编号：1002

2 题目内容：

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<br>100<br>200

Sample Output

  
  
   
   -74.4291<br>-178.8534

Author

Redow

3 解题思路形成过程：与problem 1002相似，求函数最小解，可以对其求导，在一般情况下，当F'(t) =0时，在x=t处有最小值，代入求解，然后利用二分法进行查找即可

4 代码：

#include<iostream>
#include<cmath>
using namespace std;
double g(double x)
{
return 42.0*pow(x, 6.0) + 48.0*pow(x, 5.0) + 21.0*pow(x, 2.0) + 10.0*x;
}
double f(double x, double y)
{
return 6.0*pow(x, 7.0) + 8.0*pow(x, 6.0) + 7.0*pow(x, 3.0) + 5.0*pow(x, 2.0) - x*y;
}
int main(){
int t;
double y, l, h, mid;
cin>>t;
while (t--){
cin>>y;
if (g(100.0) - y <= 0){
cout<< f(100.0, y);
}
else
{
l = 0.0;
h = 100.0;
while (h - l>1e-8){
mid = (h + l) / 2.0;
if (g(mid) - y<0)
l = mid;
else
h = mid;
}
cout<<fixed<<f(mid, y)<<endl;
}
return 0;
}