题解 | 游游的最长稳定子数组

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;

int n;
int a[N];

void solve(){
	
	int l=1,r=1;
	int maxlength=1;
	deque<int> dq;
	dq.push_back(a[r]);
	while(l<=r){
		r++;
		if(r>n) break;
		
		if(abs(dq.back()-a[r])<=1){
			dq.push_back(a[r]);
			maxlength=max(maxlength,(int)dq.size());
		}else{
			dq.clear();
			l=r;
			dq.push_back(a[r]);
		}
	}
	
	cout<<maxlength<<endl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	solve();

    return 0;
}