int RMQ(int L,int R){ int k=0; while((1<<(k+1))<=R-L+1) ++k; return max(f[L][K],f[R-(1<<k)+1][K]); }
int RMQ(int L,int R){ int k=0; while((1<<(k+1))<=R-L+1) ++k; return max(f[L][K],f[R-(1<<k)+1][K]); }
转载于:https://www.cnblogs.com/upstart/p/6808077.html