CodeForces 251A-Points on Line
来源:互联网 发布:淘宝的部门 编辑:程序博客网 时间:2024/05/17 06:02
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.
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.
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.
4 31 2 3 4
4
4 2-3 -2 -1 0
2
5 191 10 20 30 50
1
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}.
题意:问从集合中取出3个数,最大数与最小数的差值小于k的方式有多少种。
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <vector>#include <set>#include <stack>#include <map>#include <climits>using namespace std;#define LL long longconst int INF=0x3f3f3f3f;const int MAXN=1000010;int a[MAXN];int main(){ int n,k; while(~scanf("%d %d",&n,&k)) { for(int i=1;i<=n;i++) scanf("%d",&a[i]); LL ans=0; for(int i=1;i<=n-2;i++) { LL p=upper_bound(a+i,a+1+n,a[i]+k)-a-1; ans+=(p-i)*(p-i-1)/2; } printf("%lld\n",ans); } return 0;}
- CodeForces - 251A Points on Line
- CodeForces 251A-Points on Line
- codeforces 251A Points on Line 二分 or 单调队列
- CodeForces 251A Points on Line(二分)
- CodeForces 251A. Points on Line(数学 lower_bound )
- cf 251 A Points on Line 二分
- Max Points on a Line
- Max Points on a Line
- Max Points on a Line
- Max Points on a Line
- Max Points on a Line
- Max Points on a Line
- Max Points On a Line
- Max Points on a Line
- Max Points on a Line
- Max Points on a Line
- max points on a line
- Max Points on a Line
- 海思移植opencv+车辆检测
- AccessibilityService
- PHP 延迟静态绑定 功能 static
- 值得推荐的C/C++框架和库 (真的很强大)
- 删除android系统自带锁屏,导航栏、状态栏、搜索框
- CodeForces 251A-Points on Line
- webrtc中的JSEP
- nginx配置
- 设计模式之抽象工厂模式
- TCP三次握手
- 我的php的路开始
- java资源贴
- 设计模式之设计模式概述
- Python中if __name__ == "__main__": 的作用