Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
for i in range(N):
  count = 0
  for j in range(i,N-1):
    if H[j] >= H[j+1]:
      count += 1
    else:
      i += j + 1
      break;

  if count_max < count:
    count_max = count
  if count_max > N / 2:
    break;

print(count_max)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
for i in range(N):
  count = 0
  for j in range(i,N-1):
    if H[j] >= H[j+1]:
      count += 1
    else:
      i += j
      break;

  if count_max < count:
    count_max = count
  if count_max > N / 2:
    break;

print(count_max)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
for i in range(N):
  count = 0
  for j in range(i,N-1):
    if H[j] >= H[j+1]:
      count += 1
    else:
      i += j
      break;

  if count_max < count:
    count_max = count

print(count_max)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)

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

count = 0
for i in range(N):
  count_ = 0
  judge = i+1
  if count >= N - i:
    break;
  for j in range(judge,N):
    if H[i] >= H[j]:
      count_ += 1
    else:
      break;
    H[i] = H[j]
  if count_ > count:
    count = count_
  if count == N-1:
    break;

print(count)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)

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

count = 0
for i in range(N):
  count_ = 0
  judge = i+1
  for j in range(judge,N):
    if count >= N - i:
      break;
    if H[i] >= H[j]:
      count_ += 1
    else:
      break;
    H[i] = H[j]
  if count_ > count:
    count = count_
  if count == N-1:
    break;

print(count)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)

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

count = 0
for i in range(N):
  count_ = 0
  judge = i+1
  for j in range(judge,N):
    if H[i] >= H[j]:
      count_ += 1
    else:
      break;
    H[i] = H[j]
  if count_ > count:
    count = count_
  if count == N-1:
    break;

print(count)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)

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

count = 0
for i in range(N):
  count_ = 0
  judge = i+1
  for j in range(judge,N):
    if H[i] >= H[j]:
      count_ += 1
    else:
      break;
    H[i] = H[j]
  if count_ > count:
    count = count_

print(count)

Fixed submission:
N = int(input())
H = [int(e) for e in input().split()]
count_max = 0
i = 0
while i < N:
  judge = True
  count = 0
  tmp = i
  for j in range(tmp,N):
    if j < N-1:
      if H[j] >= H[j+1]:
        count += 1
      else:
        break;

  #print(count)
  if count_max < count:
    count_max = count
  if judge == True:
    i += count + 1

print(count_max)