HDOJ：2899-Strange fuction

最新推荐文章于 2020-12-25 19:08:00 发布

GoldenFingers

最新推荐文章于 2020-12-25 19:08:00 发布

阅读量157

点赞数

分类专栏：算法刷题文章标签：三分二分

本文链接：https://blog.csdn.net/yopilipala/article/details/86559583

版权

算法刷题专栏收录该内容

467 篇文章 2 订阅

订阅专栏

Strange fuction

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11079 Accepted Submission(s): 7407

Problem Description

Now, here is a fuction:
F(x) = 6x⁷+8x⁶+7x³+5x^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

解题思路：

这个函数单调性不明确，可以先对这个函数求导，42x⁶+48x⁵+21x²+10x-y，一看导数就知道是一个单调递增函数，但是零点不确定，所以在给定y之后可以二分查找零点，然后原函数带入零点得到最小值。
第二个方法就是求导看出是一个单峰函数之后直接三分。

三分答案

#include <bits/stdc++.h>
using namespace std;
const int maxn = 0;

double pow(double a, int b) {
    double ans = 1;
    for(int i=1;i<=b;i++) {
        ans *= a;
    }
    return ans;
}

bool checke(double m1, double m2, double y) {
    double ans1 = m1 * (6.0 * pow(m1, 6) + 8.0 * pow(m1, 5) + 7.0 * pow(m1, 2) + 5.0 * m1 - y);
    double ans2 = m2 * (6.0 * pow(m2, 6) + 8.0 * pow(m2, 5) + 7.0 * pow(m2, 2) + 5.0 * m2 - y);

    if(ans1 < ans2) return false;
    return true;
}

int main() {
//    freopen("1.in", "r", stdin);
    int t; scanf("%d", &t);
    while(t--) {
        double y;
        scanf("%lf", &y);
        double l = 0, r = 100;
        for (int i=1;i<60;i++) {
            double m1 = l + (r - l) / 3;
            double m2 = r - (r - l) / 3;

            if(checke(m1, m2, y))
                l = m1;
            else
                r = m2;
        }

        double ans = l * (6.0 * pow(l, 6) + 8.0 * pow(l, 5) + 7.0 * pow(l, 2) + 5.0 * l - y);
        printf("%.4f\n", ans);
    }
}