代码

#include <algorithm>

int binary_search(const unsigned *a, int n, unsigned x)
{
int ne = x*0.023283064365386963;
const unsigned *e = a + std::min(100000000,ne+4000);
const unsigned *b = std::lower_bound(a+std::max(0,ne-4000), e, x);
if(b!=e) return b-a;
	return std::lower_bound(a+std::max(0,ne-40000), a + std::min(100000000,ne+40000), x) - a;
}

评测结果