代码

inline const int Cacl_Search(int *line,const int ub,const int value){
    int down = 0;register int up=ub;
    while(1){
        register int estimate = down + 
        (long long)(up - down) *
        (long long)(value -line[down]) / 
        (line[up] - line[down]);
        if(estimate == down) ++ estimate ;
        if(estimate == up  ) -- estimate ;
        if(line[estimate] == value)return estimate;
        (line[estimate] < value?down:up) = estimate;
    }
    return 0;
}

评测结果