Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split())).reverse()
max = 0
cnt = 0

for i in range(N):
  if H[i] <= H[i+1]:
    cnt += 1
  elif cnt > max:
    max = cnt
print(max)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int, input().split()))
max = 0
 
for i in range(N-1):
  cnt = 0
  now = i
  while H[now] >= H[now+1]:
    now += 1
    cnt += 1
    if now >= N-1:
      break
  if max < cnt:
    max = cnt
print(max)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int, input().split()))
max = 0
 
for i in range(N-1):
  cnt = 0
  now = i
  while H[now] >= H[now+1]:
    now += 1
    cnt += 1
    if now >= N-1:
      break
  if max < cnt:
    max = cnt
print(max)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
max = 0

for i in range(N):
  cnt = 0
  if i != N-1:
    now = i
    while H[now] <= H[now+1]:
      now += 1
      cnt += 1
      if now > N-1:
        break
    if max < cnt:
      max = cnt
  cnt = 0
  if i != 0:
    now = i
    while H[now] <= H[now-1]:
      now -= 1
      cnt += 1
      if now < 0:
        break
    if max < cnt:
      max = cnt
print(max)


Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
max = 0

for i in range(N):
  cnt = 0
  if i != N-1:
    now = i
    while H[now] <= H[now+1]:
      now += 1
      cnt += 1
      if now < 0:
        break
    if max < cnt:
      max = cnt
  cnt = 0
  if i != 0:
    now = i
    while H[now] <= H[now-1]:
      now -= 1
      cnt += 1
      if now > N-1:
        break
    if max < cnt:
      max = cnt
print(max)


Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
max = 0

for i in range(N):
  cnt = 0
  if i != N-1:
    now = i
    while H[now] <= H[now+1]:
      now += 1
      cnt += 1
    if max < cnt:
      max = cnt
  cnt = 0
  if i != 0:
    now = i
    while H[now] <= H[now-1]:
      now -= 1
      cnt += 1
    if max < cnt:
      max = cnt
print(max)


Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
max = 0

for i in range(N):
  cnt = 0
  if i != N-1:
    now = i
    while H[now] < H[now+1]:
      now += 1
      cnt += 1
    if max < cnt:
      max = cnt
  cnt = 0
  if i != 0:
    now = i
    while H[now] < H[now-1]:
      now -= 1
      cnt += 1
    if max < cnt:
      max = cnt
print(max)


Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
max = 0

for i in range(N):
  cnt = 0
  if i != N-1:
    now = i
    while H[now] < H[now+1]:
      now += 1
      cnt += 1
    if max < cnt:
      max = cnt
  cnt = 0
  if i != 0:
    now = i
    while H[now] < H[now-1]:
      now -= 1
      cnt += 1
    if max < cnt:
      max = cnt
print(max)

Fixed submission:
N = int(input())
H = list(map(int, input().split()))
H.reverse()
max = 0
cnt = 0
 
for i in range(N-1):
  if H[i] <= H[i+1]:
    cnt += 1
  else:
    cnt = 0
  if cnt > max:
    max = cnt
if cnt > max:
  max = cnt
print(max)