莫队算法（部分模板）

#include <bits/stdc++.h>
using namespace std;
#define LL long long int
const int maxn = 1e5;
int n;
int bk[maxn];
struct mo
{
    LL l, r, id, res;
}q[maxn];
bool cmp(mo a, mo b){ return bk[a.l] == bk[b.l] ? a.r < b.r : a.l < b.l; }
bool CMP(mo a, mo b){ return a.id < b.id; }
void add(int pos){/*---do sth---*/ }
void del(int pos){/*---do sth---*/ }
int main()
{
    int block = sqrt(maxn);
    for (int i = 1; i <= 1e5; i++)
        bk[i] = (i - 1) / block;
    /*
    ---------input---------
    */
    sort(q, q + n, cmp);
    LL l = 1, r = 0;
    LL ans = 0;
    for (int i = 0; i < n; i++)
    {
        while (l<q[i].l)del(l++);
        while (l>q[i].l)add(--l);
        while (r<q[i].r)add(++r);
        while (r>q[i].r)del(r--);
        q[i].res = ans;
    }
    sort(q, q + n, CMP);
    for (int i = 0; i < n; i++)
        printf("%lld\n", q[i].res);
    return 0;
}