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

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

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

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

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

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

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

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

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

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