#include<bits/stdc++.h> using namespace std; int a[101], s[101], b[101] = {}; int n, m = 1; int main() { cin >> n; // 读取输入的n个整数 for (int i = 1; i <= n; i++) { cin >> a[i]; } // 标记满足相邻元素差值不超过2的元素 for (int i = 1; i < n; i++) { if (a[i] - a[i + 1] <= 2) { b[i] = 1; } } // 统计连续满足条件的元素个数 for (int i = 1; i <= n; i++) { if (b[i] == 1) { s[m]++; } else { m++; } } int maxLength = 0; // 找出最长的连续子序列长度 for (int i = 1; i <= m; i++) { if (s[i] > maxLength) { maxLength = s[i]; } } cout << maxLength+1; return 0; }