CodeForces
来源:互联网 发布:mac系统删除文件 编辑:程序博客网 时间:2024/06/05 03:57
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 %I64d specifier.
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}.
代码:
#include<iostream>#include<string>#include<cstdio>#include<algorithm>#include<cmath>#include<iomanip>#include<queue>#include<cstring>#include<map>using namespace std;typedef long long ll;#define M 100005ll n,d;ll a[M];int main(){ ll i; cin>>n>>d; for(i=1;i<=n;i++) { scanf("%I64d",&a[i]); } if(n<3) { cout<<0<<endl; return 0; } if(n==3) { if(a[3]-a[1]<=d) cout<<1<<endl; else cout<<0<<endl; return 0; } ll ans=0; ll s,e; s=1; e=3; while(s<=n-2) { while(e+1<=n&&a[e+1]-a[s]<=d) { e++; } ll temp=e-s; if(a[e]-a[s]<=d) temp=e-s; else temp=0; ans+=temp*(temp-1)/2; s++; } cout<<ans<<endl; return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- J
- 【转载】字符串常量到底存放在哪个存储区
- 171118 逆向-再探QQ防撤回
- 线段树区间加板子
- 子线程真的不能更新UI吗?
- CodeForces
- 如何下载并安装maven,以及在eclipse中的使用
- Learn iOS Application Distribution.pdf 英文原版 免费下载
- 4.3 构造方法与对象的创建
- java ArrayList排序不区分大小写
- 搜索策略实现-DFS,BFS,爬山法,分支界限法
- Maven-使用-DskipTests跳过单元测试
- hdu_2014 青年歌手大奖赛_评委会打分
- PL/SQL 如何处理两个timestamp类型的差值