poj 1759

一共有n只灯笼，已知最左边的一只离地高度为h1,后面的灯笼离地高度满足 Hi = (Hi-1 + Hi+1)/2 - 1, for all 1 < i < N ,求最后一只h[n]的离地高度的最小值B。
上面的式子可以化为Hi+1 = 2*Hi-1+2-Hi-2。我们二分第二只灯笼的离地高度，用上面的式子求出最后一只灯笼的高度，如果过程中又出现某只灯笼的高度小于0，那么说明二分出的高度太小了，否则就减小右边界，以减小最后一只灯笼的高度。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m;
#define N 210
#define M 100010
#define Mod 1000000000
#define p(x,y) make_pair(x,y)
const int MAX_len=550;
double h[1010];
double h1;
double ans;
bool check(double x){
    h[1] = x;
    for(int i=2;i<n;i++){
        h[i] = 2*h[i-1]+2-h[i-2];
        if(h[i]<0)
            return false;
    }
    ans = h[n-1];
    return true;
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
#endif
    while(scanf("%d%lf",&n,&h1)!=EOF){
        h[0] = h1;
        double l=0,r=10010;
        while(r-l>eps){
            double mid = (l+r)/2;
            if(check(mid))
                r = mid;
            else
                l = mid;
        }
        printf("%.2f\n",ans);
    }
    return 0;
}