【三分法】UmBasketella

DescriptionIn
recent days, people always design new things with multifunction. For instance, you can not only use cell phone to call your friends, but you can also use your cell phone take photographs or listen to MP3. Another example is the combination between watch and television. These kinds of multifunction items can always improve people’s daily life and are extremely favored by users.The company Mr. Umbrella invented a new kind umbrella “UmBasketella” for people in Rainbow city recently and its idea also comes from such multifunction–the combination of umbrella and daily necessities. This kind of umbrella can be used as a basket and you can put something you want to carry in it. Since Rainbow city rains very often, such innovative usage is successful and “UmBasketella” sells very well. Unfortunately, the original “UmBasketella” do not have an automatic volume control technology so that it is easily damaged when users try to put too many things in it. To solve this problem, you are needed to design an “UmBasketella” with maximum volume. Suppose that “UmBasketella” is a cone-shape container and its surface area (include the bottom) is known, could you find the maximum value of the cone?
Input
Input contains several test cases. Eash case contains only one real number S, representing the surface area of the cone. It is guaranteed that 1≤S≤10000.OutputFor each test case, output should contain three lines.
The first line should have a real number representing the maximum volume of the cone.
Output
the height of the cone on the second line and the radius of the bottom area of the cone on the third line.
All real numbers should rounded to 0.01.

分析：首先这是一道数学问题，即已知圆锥的表面积，求其体积最大值，进而求其高和底面半径。所以我们可以通过构造关系式来求解这道题，最难的点就在于如何把现有公式和已知量转换为关系式，注意公式3，我做了题才知道原来有这有一个公式。
思路：通过分析得知r越小h越大，所以三分范围low=0（即r），high=s/π（即h，由s的公式推导得出），接下来进行计算比较取值。

需要公式：
1.表面积 S=πrr+πrL L即侧面的母线，r是底面半径
2.体积 V=(πrrh) /3
3.母线 LL =rr+hh

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <algorithm>
#include <queue>
#include <map>
#include <cmath>
#define MAX 2000000
#define eps 1e-10
#define PI 3.1415926
using namespace std;
double s;
double Volume(double r)
{
    double L  = s/r/PI - r;
    double h  = sqrt(L*L - r*r);
    return PI*h*r*r/3 ;
}
int main()
{
    while(~scanf("%lf", &s))
    {
        double low = 0;
        double high = s / PI;
        double mid1, mid2;
        while(high - low > eps)
        {
            mid1 = low + (high - low) / 3;
            mid2 = high - (high - low) / 3;
            double v1 = Volume(mid1);
            double v2 = Volume(mid2);
            if(v1<v2)
                low = mid1;
            else high = mid2;
        }
        double ansL = s/low/PI - low;
        double ansh = sqrt(ansL*ansL - low*low);
        double ansv = PI*ansh*low*low/3 ;
        printf("%.2lf\n%.2lf\n%.2lf\n", ansv, ansh, low);
    }
    return 0;
}