牛客網 組隊 雙端隊列典型題

題目鏈接

#include<bits/stdc++.h>

using namespace std;

void solve(){
    long n,k;
    cin>>n>>k;
    long a[n];
    for(long i = 0;i < n;i++)
    {
        cin>>a[i];
    }
    sort(a,a+n);
    deque<long> q;
    long ans = 0;
    for(long i = 0;i < n;i++)
    {
        q.push_back(a[i]);
        while(q.back() - q.front() > k) q.pop_front();
        ans = max(ans,long(q.size()));
    }
    cout<<ans<<endl;
}

int main(){
    long t = 0,res = 0;
    cin>>t;
    while(t)
    {
        solve();      
        t--;
    }
    return 0;
}