循环向量的极值问题,要求在O(log(n))时间内找到最大最小值,用汇编语言实现加速读入,比二分算法的速度更快.-Cyclic vector extremum problem, requires O (log (n)) time to find the maximum and minimum, using assembly language to achieve speed up read more than half of the algorithm faster.