HDU - 6534（ 莫队+权值树状数组 ）

HDU - 6534（ 莫队+权值树状数组 ）

Sample Input

7 5 3
2 5 7 5 1 5 6
6 6
1 3
4 6
2 4
3 4

Sample Output
0
2
1
3
1

题意：求[L,R]内有多少对(i, j)满足|a[i] - a[j]| <= K，我们转换为求[a[i] - k , a[i] + k]的个数

离散化处理a[i], a[i] - k, a[i] + k的下标(二分处理)

然后莫队查询，用树状数组维护这些数，实现区间查询，区间修改

注意：用权值线段树超时了。。

代码：

#include<bits/stdc++.h>
#define l(x) (x&(-x))

using namespace std;

const int maxn = 2e5+10;
int date[maxn];
int a[maxn],b[maxn],ans[maxn];
int t[maxn];
int le[maxn],re[maxn];
int n,m,k,cnt,l,r,now,block;
struct node {
    int l,r,id;
}q[maxn];

void up(int x, int v){for(;x<=cnt;x+=l(x))t[x]+=v;}
int qu(int x){return x>0?t[x]+qu(x-l(x)):0;}

int rule( node a, node b )
{
    if ( a.l/block==b.l/block ) {
        return a.r<b.r;
    }
    return a.l<b.l;
}

void add( int i )
{
    int ll = max(1,le[i]);
    int rr = min(re[i],cnt);
    now += qu(rr)-qu(ll-1);
    up(date[i],1);
}

void del( int i )
{
    int ll = max(1,le[i]);
    int rr = min(re[i],cnt);
    up(date[i],-1);
    now -= qu(rr)-qu(ll-1);
}

int main()
{
    cnt = 0, now=0;
    scanf("%d %d %d",&n,&m,&k);
    for ( int i=1; i<=n; i++ ) {
        scanf("%d",&date[i]);
        b[cnt++] = date[i];
        b[cnt++] = date[i]-k;
        b[cnt++] = date[i]+k;
    }
    sort(b,b+cnt);
    cnt = unique(b,b+cnt) - b;
    for ( int i=1; i<=n; i++ ) {
        le[i] = lower_bound(b,b+cnt,date[i]-k)-b+1;
        re[i] = lower_bound(b,b+cnt,date[i]+k)-b+1;
        date[i] = lower_bound(b,b+cnt,date[i])-b+1;
    }
    for ( int i=1; i<=m; i++ ) {
        scanf("%d %d",&q[i].l,&q[i].r);
        q[i].id = i;
    }
    block = sqrt(m/3);
    sort(q+1,q+m+1,rule);
    l = 1; r = 0;
    date[0] = 0;
    for ( int i=1; i<=m; 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--);
        }
        ans[ q[i].id ] = now;
    }
    for ( int i=1; i<=m; i++ ) {
        printf("%d\n",ans[i]);
    }

    return 0;
}