CodeForces 251A. Points on Line(数学 lower_bound )

原创 2015年07月07日 19:47:40

题目链接:http://codeforces.com/problemset/problem/251/A


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



题意:

给出n和k,然后给出一个大小为 n 的集合,从集合中取出3个数,
最大数与最小数的差值小于k的方式有多少种。



代码如下:

#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
*/


版权声明:本文为博主原创文章,未经博主允许不得转载。vasttian

相关文章推荐

codeforces251A. Points on Line

Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. ...

cf 251 A Points on Line 二分

题意:找出三个,距离小于等于d的点,计算符合条件的三个点的所有组合数。 做法:从开始的点,固定一个点,然后二分找后面最大的但是二者距离不超过d的点,计算这些点c(n,2)。

Codeforces Round #376 (Div. 2) F. Video Cards (二分)(lower bound)

这道题主要是要只要一个 j += num[i] 来遍历,再加上一个lowerbound 二分一下,但是要边界设置好。 wa了N发~

leetcode-Max Points on a Line

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line...

Max Points on a Line

基本思路就是两点确定一条直线,所以找出points的两两组合,然后再判断剩余的点是否在当前两两组合所产生的直线上,最后就可以得出当前直线上所有的点的个数。 思路很简单,但关键要注意一个陷阱:...

(leetcode)Max Points on a Line

Question: Given n points on a 2D plane, find the maximum number of points that lie on the same st...

[leetcode] Max Points on a Line

题目: Max Points on a Line My Submissions Given n points on a 2D plane, find the ...

LeetCOde --- Max Points on a Line

第三题:Max Points on a Line

LeetCode OJ:Max Points on a Line

Max Points on a Line  Total Accepted: 3110 Total Submissions: 31616My Submissions Given ...

Max Points on a Line --- LeetCode 面试题

题目原文:Given n points on a 2D plane, find the maximum number of points that lie on the same straight l...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)