WA求调

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define A 2000000
ll t[4000006],a[1000006];
ll l[1000006],r[1000006],tot,num[1000006];
int main(){
	int n,k;cin>>n>>k;
	l[++tot]=1;
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		t[a[i]+A]++;
		if(i>1&&a[i]!=a[i-1]){
			r[tot]=i-1;
			l[++tot]=i;num[tot]=a[i];
		}
	}
	num[1]=a[1];
	r[tot]=n;
	ll mx=0;
	for(int i=1;i<=tot;i++){
		//cout<<l[i]<<" "<<r[i]<<" "<<num[i]<<endl;
		mx=max(mx,t[num[i]+A]);
		if(k){
			mx=max(mx,t[num[i]+A+k]+(r[i]-l[i]+1));
		}
	}
	cout<<mx;
	return 0;
}