题解 | 游游的最长稳定子数组-动态规划

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) a[i] = in.nextInt();

        int res = 1;
        int[] dp = new
        int[n];//dp[i]记录以i结尾的最长稳定连续子数组的长度
        dp[0] = 1;
        for (int i = 1; i < n; i++) {
            if (Math.abs(a[i] - a[i - 1]) <= 1)dp[i] = dp[i - 1] + 1;
            else dp[i] = 1;
            res = Math.max(res, dp[i]);
        }
        System.out.println(res);
    }
}