Buggy python submission (verdict: Runtime Error):
N = int(input())
H = [int, input().split(' ')]

counter = -1
last_h = float('inf')
_max = 0
for h in H:
    if h <= last_h:
        counter += 1
    else:
        if _max < counter:
            _max = counter
        counter = 0
    last_h = h
if _max < counter:
    _max = counter
print(_max)


Fixed submission:
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
if N == 1:
    print(0)
else:
    counter = 0
    for i in range(0, len(numbers)):
        if i == len(numbers) - 1:
            distances.append(counter)
            break
        if numbers[i] >= numbers[i + 1]:
            counter += 1
        else:
            distances.append(counter)
            counter = 0

    print(max(distances))

Buggy python submission (verdict: Runtime Error):
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
counter = 0
ifFirst = True
for i in range(0, len(numbers)):
    if ifFirst:
        ifFirst = False
        continue
    if numbers[i - 1] >= numbers[i]:
        counter += 1
    else:
        distances.append(counter)
        ifFirst = True
        counter = 0

print(max(distances))

Fixed submission:
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
if N == 1:
    print(0)
else:
    counter = 0
    for i in range(0, len(numbers)):
        if i == len(numbers) - 1:
            distances.append(counter)
            break
        if numbers[i] >= numbers[i + 1]:
            counter += 1
        else:
            distances.append(counter)
            counter = 0

    print(max(distances))

Buggy python submission (verdict: Runtime Error):
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
counter = 0
ifFirst = True
for i in range(0, len(numbers)):
    if ifFirst:
        ifFirst = False
    if numbers[i - 1] >= numbers[i]:
        counter += 1
    else:
        distances.append(counter)
        ifFirst = True
        counter = 0

print(max(distances))

Fixed submission:
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
if N == 1:
    print(0)
else:
    counter = 0
    for i in range(0, len(numbers)):
        if i == len(numbers) - 1:
            distances.append(counter)
            break
        if numbers[i] >= numbers[i + 1]:
            counter += 1
        else:
            distances.append(counter)
            counter = 0

    print(max(distances))

Buggy python submission (verdict: Runtime Error):
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
counter = 0
for i in range(0, len(numbers)):
    if i == 0:
        continue
    if numbers[i - 1] >= numbers[i]:
        counter += 1
    else:
        distances.append(counter)
        counter = 0

print(max(distances))

Fixed submission:
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
if N == 1:
    print(0)
else:
    counter = 0
    for i in range(0, len(numbers)):
        if i == len(numbers) - 1:
            distances.append(counter)
            break
        if numbers[i] >= numbers[i + 1]:
            counter += 1
        else:
            distances.append(counter)
            counter = 0

    print(max(distances))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
initialIndex = 0
for i in range(0, len(numbers)):
    if i < initialIndex:
        continue
    counter = 0
    for j in range(i, len(numbers)):
        if j == i:
            continue
        if numbers[j - 1] >= numbers[j]:
            counter += 1
        else:
            initialIndex = j
            break
    distances.append(counter)
print(max(distances))

Fixed submission:
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
if N == 1:
    print(0)
else:
    counter = 0
    for i in range(0, len(numbers)):
        if i == len(numbers) - 1:
            distances.append(counter)
            break
        if numbers[i] >= numbers[i + 1]:
            counter += 1
        else:
            distances.append(counter)
            counter = 0

    print(max(distances))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
for i in range(0, len(numbers)):
    counter = 0
    for j in range(i, len(numbers)):
        if j == i:
            continue
        if numbers[j - 1] >= numbers[j]:
            counter += 1
        else:
            break
    distances.append(counter)
print(max(distances))

Fixed submission:
N = int(input())
numbers = [int(n) for n in input().split(' ')]
distances = []
if N == 1:
    print(0)
else:
    counter = 0
    for i in range(0, len(numbers)):
        if i == len(numbers) - 1:
            distances.append(counter)
            break
        if numbers[i] >= numbers[i + 1]:
            counter += 1
        else:
            distances.append(counter)
            counter = 0

    print(max(distances))