RMQ问题。。 不用线段树实现。 ST算法运用的是动态规划和二进制优化的思想。使得编程复杂度降低了很多很多。-RMQ problem. . Needless to achieve segment tree. ST algorithm used is a dynamic planning and optimization of binary thinking. Makes programming reduces the complexity of many.