二分搜索应用：POJ1759 花环

题目描述：

The New Year garland consists of N lamps attached to a common wire that hangs down on the ends to which outermost lamps are affixed. The wire sags under the weight of lamp in a particular way: each lamp is hanging at the height that is 1 millimeter lower than the average height of the two adjacent lamps.

The leftmost lamp in hanging at the height of A millimeters above the ground. You have to determine the lowest height B of the rightmost lamp so that no lamp in the garland lies on the ground though some of them may touch the ground.

You shall neglect the lamp's size in this problem. By numbering the lamps with integers from 1 to N and denoting the ith lamp height in millimeters as Hi we derive the following equations:

H1 = A
Hi = (Hi-1 + Hi+1)/2 - 1, for all 1 < i < N
HN = B
Hi >= 0, for all 1 <= i <= N

The sample garland with 8 lamps that is shown on the picture has A = 15 and B = 9.75.

输入：

        The input file consists of a single line with two numbers N and A separated by a space. N (3 <= N <= 1000) is an integer representing the number of lamps in the garland, A (10 <= A <= 1000) is a real number representing the height of the leftmost lamp above the ground in millimeters.

输出：

        Write to the output file the single real number B accurate to two digits to the right of the decimal point representing the lowest possible height of the rightmost lamp.

解题思路：

        需要找出使最低灯泡不落地的最大悬挂点，从公式中可以看到，每个灯泡的高度与左右相邻的高度成正比，在最左侧高度已经确定的条件下，除了最左侧灯泡外，所有灯泡的高度都与最右侧灯泡的高度成正比。

        通过公式转化可以得到灯泡与前两个灯泡的高度关系为：

        high_t[i] = 2 * high_t[i - 1] + 2 - high_t[i - 2];

        每个结点都只要知道前两个结点的高度就能推出来，第一个结点已经确定，只需要找到满足要求的最小的第二个结点高度就可以了。

解题步骤：

        1、建立高度数组，存放每一个灯泡的高度，由于是浮点数，还需要定义一个精度常量e；

        2、浮点数的穷举条件不能再用high >= low，需要用high - low > e；

        3、在判断函数中，根据不断地根据前两项确定本项的值，不能有一个在地面以下。

代码实现：

        

#include <iostream>
using namespace std;
#define e 1e-8
#define maxn 1010
#define inf 0x3f3f3f3f

int n;
double a;
double high_t[maxn];

bool Judge(double x)
{
    high_t[2] = x;
    for (int i = 3; i <= n; i++)
    {
        high_t[i] = 2 * high_t[i - 1] + 2 - high_t[i - 2];
        if (high_t[i] < e)
        {
            return false;
        }
    }
    return true;
}

int main()
{
    cin >> n >> a;
    high_t[1] = a;
    double low = 0, high = inf;
    while (high - low > e)
    {
        double mid = low + (high - low) / 2;
        if (Judge(mid))
        {
            high = mid;
        }
        else
        {
            low = mid;
        }
    }
    printf("%.2f\n",high_t[n]);
    return 0;
}