题解:双指针法
#include<bits/stdc++.h>
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, r = 0, ans = 1, res = 0;
while(r < n){
if(a[r+1] == a[r] + 1){
r++;
ans++;
}else{
r++;
l = r;
ans = 1;
}
res = max(res,ans);
}
cout<<res<<endl;
}