二分查找之弯曲的木杆

二分法解超越方程

#include <iostream>
#include <memory.h>
#include <math.h>
#include <stdio.h>
#include <unordered_map>
#include <string>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
double L;
double n,C;
double fun(double h)
{
    double d = h + ((L * L) / (4.0 * h));
    return (d * asin( (1.0 *L) / (1.0 * d)));
}
int main()
{
    while( cin >> L >> n >> C, L != -1 && n != -1 && C != -1 )
    {
        double rightl = L * ( 1 + n*C );
        if( L==0 || n==0 || C==0 )
            {
                printf("0.000\n");
                continue;
            }
        double left = 0.0, right = L, mid;
        while( right - left > 1e-6 )
        {
            mid = (right-left)/2.0 + left;
            if( fun(mid) < rightl )
            {
                left = mid;
            }
            else
            {
                right = mid;
            }
        }
        printf("%.3f\n", mid);
    }
    return 0;
}