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

    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 second

    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #include<math.h>
    #include<iostream>
    #include<stdlib.h>
    #include<set>
    #include<map>
    #include<queue>
    #include<vector>
    #define inf 2000000000
    #define PI acos(-1.0)
    #define lson(x) (x<<1)
    #define rson(x) ((x<<1)|1)
    #define rep(i,a,b) for(int i=a;i<=b;i++)
    #define drep(i,a,b) for(int i=a;i>=b;i--)
    using namespace std;
    typedef long long ll;
    
    int a[100100],n,d;
    int minx[100100][30];
    int maxx[100100][30];
    void init_RMQ(int n) 
    {
    	rep(i,1,n)maxx[i][0]=minx[i][0]=a[i];
    	for(int j = 1; j < 20; ++j)
    	for(int i = 1; i <= n; ++i)
    		if(i + (1 << j) - 1 <= n)
    		{
    			maxx[i][j] = max(maxx[i][j - 1], maxx[i + (1 << (j - 1))][j - 1]);
    			minx[i][j] = min(minx[i][j - 1], minx[i + (1 << (j - 1))][j - 1]);
    		}
    }
    int getmax(int x,int y){
    	if(x>y)swap(x,y);
    	int k=log((y-x+1)*1.0)/log(2.0);
    	return max(maxx[x][k],maxx[y-(1<<k)+1][k]);
    }
    int getmin(int x,int y){
    	if(x>y)swap(x,y);
    	int k=log((y-x+1)*1.0)/log(2.0);
    	return min(minx[x][k],minx[y-(1<<k)+1][k]);
    }
    
    int main(){
    	scanf("%d%d",&n,&d);
    	rep(i,1,n)scanf("%d",&a[i]);
    	init_RMQ(n);
    	int l=1;
    	int r=3;
    	long long ans=0;
    	rep(i,3,n){
    		r=i;
    		while(getmax(l,r)-getmin(l,r)>d)l++;
    		if(r-l+1>=3){
    			//printf("%d %d
    ",l,r);
    			ans+=(r-l)*1LL*(r-l-1)/2LL;
    		}
    	}
    	printf("%I64d
    ",ans);
    }

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

    这题也可以用rmq做,然后依次枚举l,r



  • 相关阅读:
    几维安全SDK应用加固,全线5折为APP保驾护航
    物联网渗透测试威胁建模,捕捉应用相关安全风险
    【几维安全】Android代码混淆,代码混淆工具,Android版使用详细说明
    畅想物联网安全未来,几维安全让万物互联更安全
    域起网络携手几维安全,护航互联网游戏业务安全
    Android 加密, Android 常用加密, Android So 库高强度加密
    车联网安全威胁分析及防护思路,几维安全为智能汽车保驾护航
    C#实现基于ffmpeg加虹软的人脸识别
    OSX 下搭建Asp.Net vNext的开发环境
    验证码识别记录
  • 原文地址:https://www.cnblogs.com/herumw/p/9464797.html
Copyright © 2011-2022 走看看