weixin_45113721的博客

插入易做 删除不易1.暴力求块内询问

块大小取n2/3优于取sqrt(n)的情况，总体复杂度O(n5/3)。大小为pow(n t,1/3) 时间复杂度pow(n n* n *n *t,1/3)#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;const int N=1e4+100;int a[N];struc

sqrt(n) O(msqrt(n))sqrt(n*n/m) O(nsqrt(m))排序：奇数块从小到大 偶数块从大到小#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;const int N=2e5+100;const int M=1e6+100;int cnt[M

莫队算法是离线算法，不支持修改，强制在线需要另寻他法。的确，遇到强制在线的题目莫队基本上萎了，但是对于某些允许离线的带修改区间查询来说，莫队还是能大展拳脚的。讲解：https://www.cnblogs.com/WAMonster/p/10118934.htmlhttps://blog.youkuaiyun.com/qq_45458915/article/details/106958683代码：#include<cstdio>#include<cstring>#include<

讲解：https://www.cnblogs.com/WAMonster/p/10118934.html代码：#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#include<cmath>using namespace std;co...

讲解：https://www.cnblogs.com/WAMonster/p/10118934.html#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#define maxn 1010000#define maxb 1010using namespa...