#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int l = 0; int max_len = 0; for (int r = 0; r < n; r++) { // 不满足条件，左指针右移 while (a[l] - a[r] > 2) { l++; } max_len = max(max_len, r - l + 1); } cout << max_len << endl; return 0; }