UmBasketella(三分算法解决单峰问题)

本文介绍了一款名为“UmBasketella”的多功能雨伞,它结合了雨伞与篮子的功能,特别适合多雨的城市。文章提供了两种计算该雨伞作为圆锥形容器时最大体积的算法实现,并详细解释了计算原理。

Question

In 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.

Output

For 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.

Simple Input

30

Simple Output

10.93
4.37
1.55

Code 1

#include <iostream>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;

double pi=acos(-1.0);
double S;

double height(double r);
double valume(double r);

int main()
{
    int i,j,k;
    double l,r,mid1,mid2;
    while(cin>>S)
    {
        l=0;r=sqrt(S/(pi*2));//尽量缩小l和r的范围,不可写成sqrt(S/pi)。
        while(l+0.0001<r)
        {
            mid1=(r+l)/2.0;
            mid2=(mid1+r)/2.0;
            if(valume(mid1)>valume(mid2))
                r=mid2;
            else
                l=mid1;
        }
        printf("%.2lf\n",valume(l));
        printf("%.2lf\n",height(l));
        printf("%.2lf\n",l);
    }

    return 0;
}
double height(double r)
{
    double R;
    R=(S-pi*r*r)/(pi*r);
    return sqrt(R*R-r*r);
}
double valume(double r)
{
    double h;
    h=height(r);
    return pi*r*r*h/3.0;
}

Code 2

#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;

double PI=acos(-1.0);

int main()
{
    double s,h,r,v;
    while(cin>>s)
    {
        r=sqrt(s/PI)/2.0;
        h=sqrt((s*s)/(PI*PI*r*r)-2.0*s/PI);
        v=PI*r*r*h/3.0;
        printf("%.2lf\n%.2lf\n%.2lf\n",v,h,r);
    }
    return 0;
}

说明:圆锥体面积:S=PI*L*R+PI*R*R;L=sqrt(h*h+R*R);
既有R*R=S*S/(PI*PI*h*h+2*PI*S);
V=PI*R*R*h/3;将R*R带入求导函数零点即为最大值点;即可求出h,r,v

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值