CodeForces 251A The Distance

A - The Distance

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 251A

Description

Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance between the two farthest of them doesn't exceed d.

Note that the order of the points inside the group of three chosen points doesn't matter.

Input

The first line contains two integers: n and d (1 ≤ n ≤ 10⁵; 1 ≤ d ≤ 10⁹). The next line contains n integers x₁, x₂, ..., x_n, their absolute value doesn't exceed 10⁹ — the x-coordinates of the points that Petya has got.

It is guaranteed that the coordinates of the points in the input strictly increase.

Output

Print a single integer — the number of groups of three points, where the distance between two farthest points doesn't exceed d.

Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Sample Input

Input

4 3
1 2 3 4

Output

4

Input

4 2
-3 -2 -1 0

Output

2

Input

5 19
1 10 20 30 50

Output

1

Hint

In the first sample any group of three points meets our conditions.

In the seconds sample only 2 groups of three points meet our conditions: {-3, -2, -1} and {-2, -1, 0}.

In the third sample only one group does: {1, 10, 20}.

排序后枚举第一个点，下表记为a，然后二分这点之后所有点找出差不超过d的最大位置，下标记为b，那么以a为起点共有

C（2，b-a）种取法。最后累加所有a即可。

#include <iostream>

using namespace std;
long long n,d,ans=0;
long long a[101000];
long long bse(long long x,long long nn){
   long long  l=x,r=n,m,i,j;
   m=(l+r)/2;
   if (x==n) {
     if (a[x]-a[nn]>d) return x-1;
     else return n;
   }
   if (a[r]-a[nn]<=d) return r;
   if (a[l]-a[nn]>d) return x-1;
   while (l<r){
     if (a[m]-a[nn]>d) r=m-1;
     else l=m;
     if (a[r]-a[nn]>d) r=r-1;
     m=(l+r)/2;
     if (a[r]-a[nn]<=d) return r;
   }
   return m;
}
int main()
{
    cin>>n>>d;
    long long i;
    for (i=1;i<=n;i++) cin>>a[i];
    ans=0;
    for (i=1;i<n;i++) {
      long long t=bse(i+1,i)-i;
      ans=ans+t*(t-1)/2;
    }
    cout<<ans<<endl;
    return 0;
}