hdu5178——pairs【尺取法，二分】

最新推荐文章于 2020-01-12 12:11:43 发布

gx翔鸽

最新推荐文章于 2020-01-12 12:11:43 发布

阅读量279

点赞数

分类专栏：二分常用技巧文章标签：尺取法 2018暑假集训

本文链接：https://blog.csdn.net/xiang_hehe/article/details/81268998

版权

二分同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

常用技巧

4 篇文章 0 订阅

订阅专栏

pairs

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4256 Accepted Submission(s): 1518

Problem Description

John has n points on the X axis, and their coordinates are (x[i],0),(i=0,1,2,…,n−1) . He wants to know how many pairs<a,b> that |x[b]−x[a]|≤k.(a<b)

Input

The first line contains a single integer T (about 5), indicating the number of cases.
Each test case begins with two integers n,k(1≤n≤100000,1≤k≤109) .
Next n lines contain an integer x[i](−109≤x[i]≤109) , means the X coordinates.

Output

For each case, output an integer means how many pairs<a,b> that |x[b]−x[a]|≤k .

Sample Input

2 5 5 -100 0 100 101 102 5 300 -100 0 100 101 102

Sample Output

3 10

Source

BestCoder Round #31

Recommend

hujie | We have carefully selected several similar problems for you: 6318 6317 6316 6315 6314

Statistic | Submit | Discuss | Note

用尺取法，以每一个数的开始坐标为上界开始搜索。

#include<algorithm>
#include<cstdio>
#include<iostream>
using namespace std;
const int MAXN=1000005;
typedef long long LL;
LL a[MAXN];
bool cmp(LL a,LL b){
    return a<b;
}
int main(){
    LL n,t,k;
    scanf("%lld",&t);
    while(t--){
        scanf("%lld%lld",&n,&k);
        for(int i=0;i<n;i++){
            scanf("%lld",&a[i]);
        }
        sort(a,a+n,cmp);
        LL ans=0,i,j;
        for(i=0,j=0;i<n;i++){
            //printf("%lld\n",j);
            while(j+1<n&&a[j+1]-a[i]<=k) j++;
            ans=ans+(j-i);
        }
        printf("%lld\n",ans);
    }
    return 0;
}