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

#include <iostream>
#include <cmath>

using namespace std;

//看起来连续是滑动窗口但是实际是离散的
int main() {
	int n;
	cin >> n;
	int* a = new int[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	} 
	if (n == 1) {
		cout << 1 << endl;
		return 1;
	}
	int left = 0, right = 1, ans = 0;
	while (left < n) {
		while (right < n && abs(a[right] - a[right - 1]) <= 1) {
			right++;
		}
		ans = max(ans, right - left);
		left = right;
		right++;
	}
	cout << ans << endl;
}