# CodeForces 251A. Points on Line（数学 lower_bound ）

773人阅读 评论(0)

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 ≤ 105; 1 ≤ d ≤ 109). The next line contains n integers x1, x2, ..., xn, their absolute value doesn't exceed 109 — 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 cincout streams or the %I64dspecifier.

Sample test(s)
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

Note

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}.

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
#define LL __int64
int main()
{
int n;
LL d;
LL a[100047];
while(~scanf("%d%I64d",&n,&d))
{
for(int i = 0; i < n; i++)
{
scanf("%I64d",&a[i]);
}
LL ans = 0;
for(int i = 1; i < n; i++)
{
LL tt = i-(lower_bound(a,a+i,a[i]-d)-a)-1;
ans+=tt*(tt+1)/2;//C n 2
}
printf("%I64d\n",ans);
}
return 0;
}
/*
4 3
1 2 3 4
4 2
-3 -2 -1 0
5 19
1 10 20 30 50
*/

1
0

Motto
• 你必须非常努力，
• 才能看起来毫不费力。
• tianyiming：2013/10/15 18:00
• wdnlwzd：2014/07/30 21:32
• vasttian： 2016/12/29 12:00
Vasttian
Blogs
个人资料
• 访问：1078526次
• 积分：21065
• 等级：
• 排名：第449名
• 原创：871篇
• 转载：72篇
• 译文：0篇
• 评论：253条