Advertisement
Guest User

Untitled

a guest
Jun 18th, 2019
175
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.46 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define maxn 200010
  4. #define ll long long
  5. int a[maxn];
  6. int n,s;
  7. int main()
  8. {
  9. scanf("%d%d",&n,&s);
  10. for(int i=1;i<=n;i++)scanf("%d",&a[i]);
  11. ll ans=0;
  12. for(int i=2,l=1,r=2;i<n;i++)
  13. {
  14. while(a[i]-a[l]>s)l++;
  15. while(r<=n && a[r]-a[i]<=s)r++;
  16. ans+=1ll*(l-1)*(n-r+1);
  17. }
  18. printf("%lld\n",ans);
  19. return 0;
  20. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement