HDU 5178 pairs STL二分函数

pairs

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

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
  
  
  
  


  
  
  
  

   
   初次使用二分...还不熟悉啊，关键还是爆数据，已经多次出错了，看来以后都要 long long。
  
  
  
  


  
  
  
  

   
   
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <queue>
#include <cstdlib>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,k,a[100005];
        long long t=0;
        scanf("%d%d",&n,&k);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        for(int i=0;i<n;i++)
            t+=upper_bound(a+i,a+n,a[i]+k)-(a+i)-1;
        printf("%lld\n",t);
    }
    return 0;
}
   
   

    
    

   
   
   
   
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <set>
#include <queue>
#include <cstdlib>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,k,a[100005];
        long long t=0;
        scanf("%d%d",&n,&k);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        sort(a,a+n);
        for(int i=0;i<n;i++)
            t+=lower_bound(a+i,a+n,a[i]+k+1)-(a+i)-1;
        printf("%lld\n",t);
    }
    return 0;
}