HDU 6534 Chika and Friendly Pairs（树状数组，莫队，离散化）

在莫队插入数字x时查询区间（x+k，x-k）之间有多少个，删除同理。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 3e4;
const int maxm = 3e4;
const int MAX = 1e5;
int s[maxn], ans[maxm], cnt[MAX], lsh[MAX];
int C[MAX];
int unit, num;
int n,k,m,len;

struct Node{
    int ak,sk,zj;
}pos[maxn];
int lowbit(int i)
{
    return i & -i;//或者是return i-(i&(i-1));表示求数组下标二进制的非0最低位所表示的值
}
void update(int i, int val) //单点更新
{
    while(i <= len)
    {
        C[i] += val;
        i += lowbit(i); //由叶子节点向上更新树状数组C，从左往右更新
    }
}
int sum(int i)//求区间[1,i]内所有元素的和
{
    int ret = 0;
    while(i > 0)
    {
        ret += C[i]; //从右往左累加求和
        i -= lowbit(i);
    }
    return ret;
}
struct node
{
    int id, l, r;
} q[maxm];
bool cmp(node a, node b)
{
    if((a.l / unit) != (b.l / unit)) return a.l < b.l;
    return a.r < b.r;
}
void add(int x)
{
    int t = s[x];
    num += (sum(pos[x].ak) - sum(pos[x].sk-1));
    update(pos[x].zj, 1);
}
void rem(int x)
{
    int t = s[x];
    update(pos[x].zj, -1);
    num -= (sum(pos[x].ak) - sum(pos[x].sk-1));
}

int main()
{
//    freopen("in.txt", "r", stdin);
    scanf("%d", &n);
    scanf("%d", &m);
    scanf("%d", &k);
    len = 0;
    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &s[i]);
        lsh[++len] = s[i] - k, lsh[++len] = s[i] + k, lsh[++len] = s[i];
    }
    unit = sqrt(n); num = 0;

    sort(lsh + 1, lsh + 1 + len);
    len = unique(lsh + 1, lsh + 1 + len) - lsh - 1;
    for(int i = 1; i <= n; i++)
    {
        pos[i].zj = lower_bound(lsh + 1, lsh + 1 + len, s[i]) - lsh;
        pos[i].ak = lower_bound(lsh + 1, lsh + 1 + len, s[i] + k) - lsh;
        pos[i].sk = lower_bound(lsh + 1, lsh + 1 + len, s[i] - k) - lsh;
    }

    for(int i = 1; i <= m; i++)
    {
        scanf("%d%d", &q[i].l, &q[i].r);
        q[i].id = i;
    }
    sort(q + 1, q + 1 + m, cmp);
    int le = q[1].l, ri = le - 1;
    for(int i = 1; i <= m; i++)
    {
        while(le > q[i].l) add(--le);
        while(le < q[i].l) rem(le++);
        while(ri > q[i].r) rem(ri--);
        while(ri < q[i].r) add(++ri);
        ans[q[i].id] = num;
    }
    for(int i = 1; i <= m; i++) printf("%d\n", ans[i]);
    return 0;
}