![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
RMQ
wtcl
这个作者很懒,什么都没留下…
展开
-
POJ - 3693(后缀数组)
讲解:https://blog.csdn.net/queuelovestack/article/details/53035903 #include <cstdio> #include <cstring> #include<iostream> #include <algorithm> #include<cmath> #define F(x)...原创 2020-04-02 09:56:14 · 227 阅读 · 0 评论 -
RMQ(求区间最大最小值)
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<cmath> using namespace std; const int N=2e5+10; int a[N]; int f[N][17]; int n; void i...原创 2020-04-01 09:57:21 · 126 阅读 · 0 评论