2019.04.19:莫队算法主要的降低时间复杂度的技巧是分块,可以把询问离线然后分块做,块的大小(\sqrt n),即可。同块右端点排序,不同块左端点排序。不同题目分块之后处理的方法不同,具体题目具体分析。
https://www.luogu.org/problemnew/show/P2709
#include<bits/stdc++.h>
#define maxn 50005
using namespace std;
int a[maxn], cnt[maxn];
long long ans[maxn];
struct ask{
int l, r, id;
}q[maxn];
bool cmp(const ask &a, const ask &b){return a.l / 500 == b.l / 500 ? a.r < b.r : a.l < b.l;}
int main()
{
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= m; ++i) scanf("%d %d", &q[i].l, &q[i].r), q[i].id = i;
sort(q, q + m, cmp);
int l = 1, r = 0;
long long sum = 0;
for (int i = 1; i <= m; ++i){
while (l > q[i].l) --l, ++cnt[a[l]], sum += 2 * cnt[a[l]] - 1;
while (r < q[i].r) ++r, ++cnt[a[r]], sum += 2 * cnt[a[r]] - 1;
while (l < q[i].l) sum += 1 - 2 * cnt[a[l]], --cnt[a[l]], ++l;
while (r > q[i].r) sum += 1 - 2 * cnt[a[r]], --cnt[a[r]], --r;
ans[q[i].id] = sum;
}
for (int i = 1; i <= m; ++i) printf("%lld\n", ans[i]);
return 0;
}