zoukankan      html  css  js  c++  java
  • Points on Line

    Points on Line
    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 ≤ 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 cin, cout streams or the %I64d specifier.

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




    #include <algorithm>
    #include <stdio.h>
    using namespace std;
    #define N 100100
    int num[N];
    int main()
    {
        long long m,n,t,i,sum=0;
          scanf("%lld %lld",&n,&m);
          for(i=0;i<n;i++)
            scanf("%d",&num[i]);
        for(i=0;i<n-2;i++)
        {
          t=upper_bound(num,num+n,num[i]+m)-num;
          sum+=(t-i-1)*(t-i-2)/2;//排列组合化简,下标为t-i-1,上标为2,算C
        }
        printf("%lld",sum);
        return 0;
    
    }
    

  • 相关阅读:
    Redis面试题
    Mysql面试题
    Mybatis面试题
    Springmvc面试题
    spring常见面试题
    优雅的参数校验
    Linux安装mongodb
    Redis缓存的雪崩、穿透、击穿
    语音识别(LSTM+CTC)
    大数据利器Hive
  • 原文地址:https://www.cnblogs.com/ljhacm/p/6905823.html
Copyright © 2011-2022 走看看