代码

int binary_search(const unsigned *a, int n, unsigned X)
{
int L = 0, R = 100000000 - 1;
unsigned long long x = X;
	while(L<R-100){
int md = (R * (x - a[L]) + L * (a[R] - x)) / (a[R] - a[L]);
if(a[md] == x) return md; else if(a[md] < x) L = md + 1; else R = md - 1;
}
while(L<R) {
int md = (L + R) / 2;
if(a[md] == x) return md; else if(a[md] < x) L = md + 1; else R = md - 1;
}
return L;
}

评测结果