C++ 解法, 执行用时: 5ms, 内存消耗: 464K, 提交时间: 2021-10-07 19:15:33

#include<iostream>
using namespace std;
int n,m=0;
int main() {
	cin>>n;
	int a[n],i,k,j=1;
	for( i=0; i<n; i++)cin>>a[i];
	for( i=1; i<n; i++) {
		if(a[i]==a[i-1]+1) {
			j++;
			if(j>m)m=j,k=i;
		} else j=1;
	}
	cout<<m-2;
}

Python3(3.5.2) 解法, 执行用时: 56ms, 内存消耗: 3436K, 提交时间: 2019-12-19 13:56:41

n=int(input())
a=list(map(int,input().split(' ')))
b=[]
for i in range(n-1):
    count=1
    while a[i]+1==a[i+1]:
        count+=1
        if i==n-2:
            break
        i+=1
    b.append(count-2)
print(max(b))

Python(2.7.3) 解法, 执行用时: 20ms, 内存消耗: 2864K, 提交时间: 2019-12-09 14:56:20

n = int(raw_input())
a = [0] + map(int, raw_input().split()) + [1001]
i = 1; k = 1; m = 0;
while i <= n + 1:
    if (a[i] != a[i - 1] + 1) : k = 1
    else : k = k + 1
    m = max(k, m)
    i = i + 1
print m - 2