wustacm2021周赛3 打怪兽

传送门

水一手双指针

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<double, double> P;

const int maxn = 2e5 + 100;
const LL INF = 1e18;
const double eps = 1e-6;
const LL mod = 1e9 + 7;

int arr[maxn];

void solve() {      
    int n; cin >> n;
    for(int i = 1; i <= n; i++) cin >> arr[i];
    sort(arr+1, arr+1+n);
    int s = 1, t = 1;
    int res = 1;
    if(arr[n] - arr[1] <= 5) {
        cout << n << endl;
        return ;
    } 
    for(;;) {
        while(t <= n && arr[t] - arr[s] <= 5) {
            t++;
        }
        if(arr[t] - arr[s] <= 5) break;
        res = max(res, t - s);
        s++;
    }
    cout << res << endl;
}   

int main() {
    ios::sync_with_stdio(false);
    solve();
    return 0;
}