#include <iostream>

 using namespace std;

 int maxCover(int* a, int n, int l)

 {

     int maxCover = ;

     int begin = ;

     int end = ;

     while(end < n)

     {

         if(a[end] - a[begin] > l)

         {

             maxCover = (end - begin) > maxCover?(end - begin):maxCover;

             begin++;

         }

         else

             end++;

     }

     return maxCover;

 }

 int main()

 {

     int a[] = {,,,,,};

     cout<<"最大的覆盖个数："<<maxCover(a,,)<<endl;

     return ;

 }