| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 31303 | 陈路垚 | 最长连号 | C++ | Accepted | 100 | 0 MS | 256 KB | 324 | 2022-02-03 12:08:55 |
#include<iostream> short n,a[10000],ln=-1,maxn,len; int main(){ scanf("%hd",&n); for(short i=0;i<n;i++){ scanf("%hd",&a[i]); if(a[i]-1!=ln){ if(len>maxn&&len!=1) maxn=len; len=1; ln=a[i]; }else{ len++; ln=a[i]; } } if(len>maxn&&len!=1) maxn=len; printf("%hd",maxn); return 0; }