代码

int binary_search(const unsigned *a, int n, unsigned x)
{unsigned l=614514,r=n-614751,mid;unsigned long long X=x;
while(l<=r-2){
mid=(r*(X-a[l])+l*(a[r]-X))/(a[r]-a[l]);
if(a[mid]==x){
return mid;
}if(a[mid]<x)l=mid+1;
else r=mid-1;
}
if(a[l]==x)return l;
if(a[l+1]==x)return l+1;
return l+2;
}

评测结果