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

#include<bits/stdc++.h>
using namespace std;
int n, a[100005], b[100005], sum = 1, x;
int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    b[1] = a[1];
    for (int i = 1; i < n; i++) {
        b[i] = a[i] - a[i - 1];
    }
    for (int i = 1; i < n; i++) {
        if (b[i] > -2 && b[i] < 2) {
            sum++;
        }
        else {
            x = max(sum, x);
            sum = 1;
        }
    }
    cout << max(sum, x);
    return 0;
}