博客停更，请到"再见，优快云"文章中找新博客地址

poj 3264RMQ模板题。#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ms(i, j) memset(i, j, sizeof i)using namespace std;const int MAXN = 50000 + 5;int n, q;int h[MAXN], fmaxi

模板及讲解 运用st表实现区间询问区间最大/最小，初始化时间复杂度O(nlogn)O(nlogn), 查询O(1)O(1) 模板题：poj 3264#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define ms(i, j) memset(i, j, sizeof i)using namespac