Buggy python submission (verdict: Runtime Error):
N =int(input())
h=list(map(int,input().split()))
L = [0]*(N-1)

for i in range(N-2,-1,-1):
  if h[i] >= h[i+1]:
    L[i] = L[i+1] + 1
    
print(max(L))

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
h = list(map(int,input().split()))
L = [0] * (N-1)

for i in range(N-2,-1,-1):
  if h[i] >= h[i+1]:
    L[i+1] = L[i] + 1
    
print(max(L))    

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
h = list(map(int, input().split()))
cnt=[0]*(N-1)
ans=[0]*(N-1)
counter=1
if N==1:
  print(0)
else:
  for i in range(N-1):
    if h[i] >= h[i+1]:
      cnt[i]=counter
    else:
      counter+=1
  for j in range(1,counter+1):
    ans[j]=cnt.count(j)
  print(max(ans))

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
h = list(map(int, input().split()))
cnt=[0]*(N-1)
ans=[0]*(N-1)
counter=1
if N==1:
  print(0)
else:
  for i in range(N-1):
    if h[i] >= h[i+1]:
      cnt[i]=counter
    else:
      counter+=1
  for j in range(1,counter+1):
    ans[j-1]=cnt.count(j)
  print(max(ans))

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
h_ = list(input().split())
h = [int(i) for i in h_]
cnt=[0]*(N-1)
ans=[0]*(N-1)
counter=1
if N==1:
  print(0)
else:
  for i in range(N-1):
    if h[i] >= h[i+1]:
      cnt[i]=counter
    else:
      counter+=1
  for j in range(1,counter+1):
    ans[j]=cnt.count(j)
  print(max(ans))

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
h_ = list(input().split())
h = [int(i) for i in h_]
cnt=[0]*(N-1)
ans=[0]*(N-1)
counter=1
if N==1:
  print(0)
else:
  for i in range(N-1):
    if h[i] >= h[i+1]:
      cnt[i]=counter
    else:
      counter+=1
for j in range(N-1):
  ans[j]=cnt.count(j)
print(max(ans))

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
h_ = list(input().split())
h = [int(i) for i in h_]
cnt=[0]*(N-1)
for i in range(N-1):
  for j in range(i,N-1):
    if h[j] >= h[j+1]:
      cnt[i]+=1
    else:
      break
print(max(cnt))

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
dp = [0] * len(H) 
for i in range(1, len(H)):
  if H[i-1] >= H[i]: 
    dp[i] = dp[i-1] + 1
ans = max(dp)
print(ans)