Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
List = list(map(int,input().split()))
max = 0
adj = 0
rest = n
for i in range(n-1):
    counter = 0
    i = i + adj
    if i < n:
        for j in range(n-i-1):
            if List[i+j] >= List[i+j+1]:
                counter +=1
                if counter > max:
                    max = counter
                adj = j
                if rest < max:
                    break
            else:
                break
    else:
        break
        
print(max)

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

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
List = list(map(int,input().split()))
max = 0
adj = 0
rest = n
for i in range(n-1):
    counter = 0
    i = i + adj
    if i < n:
        for j in range(n-i-1):
            if List[i+j] >= List[i+j+1]:
                counter +=1
                if counter > max:
                    max = counter
                adj = j
                if rest < max:
                    break
            else:
                break
    else:
        break
        
print(max)

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

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
List = list(map(int,input().split()))
max = 0
rest = n
for i in range(n-1):
    counter = 0
    for j in range(n-i-1):
        if List[i+j] >= List[i+j+1]:
            counter +=1
            if counter > max:
                max = counter
            
            if rest < max:
                break
        else:
            break
        
print(max)



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

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
List = list(map(int,input().split()))

max = 0
rest = n
for i in range(n-1):
    counter = 0
    for j in range(n-i-1):
        if List[i+j] >= List[i+j+1]:
            counter +=1
            if counter > max:
                max = counter
            
            if rest < max:
                break
        else:
            break
        
print(max)

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

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int,input().split()))
counter = 0

for i in reversed(range(N)):
  minicounter = 0
  for j in range(N-i-1):
    if H[i] >=H[i+1]:
      #print('i',i,'j',j)
      i +=1
      minicounter +=1
    else:
      break
  if minicounter > counter:
    counter = minicounter

print(counter)

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