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

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main {
    static int N = (int)(1e5+10);
    static int n;
    static long[] a = new long[N];
    
    static void solve() {
        n = in.nextInt();
        for(int i=1;i<=n;i++) {
            a[i] = in.nextLong();
        }
        int cnt = 0, ans = 0;
        for(int i=1;i<=n;i++) {
            if(Math.abs(a[i]-a[i+1])<=1) {
                cnt++;
            }else {
                ans = Math.max(ans,cnt+1);
                cnt = 0;
            }
        }
        out.println(ans);
    }

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    static FastReader in = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        static BufferedReader br;
        static StringTokenizer st;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            String str = "";
            while (st == null || !st.hasMoreElements()) {
                try {
                    str = br.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                st = new StringTokenizer(str);
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}