Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- long long int y,n,k,i,j,b,c,d,x,ans;
- while(cin>>y)
- {
- cin>>n;
- long long int a[n+1];
- for(i=0;i<n;i++)
- cin>>a[i];
- long long int mx=0,first=0,last=0;
- for(i=0;i<n;i++)
- {
- b=a[i]+y-1;
- c=upper_bound(a,a+n,b)-a;
- d=lower_bound(a,a+n,a[i])-a;
- ans=c-d;
- if(ans>mx)
- {
- mx=ans;
- first=a[i];
- last=a[c-1];
- }
- }
- cout<<mx<<" "<<first<<" "<<last<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement