c prog. Find two points in an array y=-x+b

最大间隙问题：给定n 个实数x , x , , xn 1 2  ，求这n 个数在实轴上相邻2 个数之间的最 大差值。假设对任何实数的下取整函数耗时O(1)，设计解最大间隙问题的线性时间算法。-The maximum gap problem: given n real numbers x, x, xn 1 2  , seeking the n numbers adjacent to the maximum difference between the two num