搜索算法 problem（1002）

1.简明题意

求出方程F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x在0~100之间的最小值

2.解题思路

利用二分法对这个方程的一阶导数进行处理，得到极值点，带入原式

3.感想

和第一题一样

4.AC代码

#include<iostream>
#include<math.h>
#include<iomanip>
using namespace std;
double y;
const double eps = 1e-10;
double Calc(double x)
{
    return 6.0 * pow(x,7) + 8 * pow(x,6)+ 7 *pow(x,3) + 5 * pow(x,2) - y * x;
}
double Calcc(double x)
{
    return 42 * pow(x, 6) + 48 * pow(x, 5) + 21 * pow(x, 2) + 10 * pow(x, 1);
}
double solve()
{
    double left, right;
    double mid;
    left = 0;
    right = 100;
    while (left+eps<right)
    {
        mid = (left + right) / 2;
        if (y-Calcc(mid)<eps)
        {
            right = mid;
        }
        else 
        {
            left = mid;
        }
    }
    return mid;
}
int main()
{
    double Calc(double x);
    double solve();
    int a;
    double mid, result;
    cin >> a;
    for (int i = 0; i < a; i++)
    {
        cin >> y;
        mid=solve();
        result = Calc(mid);
        cout<<setiosflags(ios::fixed)<<setprecision(4) << result <<endl;
    }
    return 0;
}