LoginSignup
0
0

More than 1 year has passed since last update.

ABC139 C - Lower を解いた

Posted at

abc139_1.png
abc139_2.png

もっと上手な書き方はあると思う。

Lower.py
N = int(input())
H = list(map(int,input().split()))

ref = H[0]
cnt = 0
ans = 0
for i in range(1,N):
    if H[i] <= ref:
        cnt += 1
        ref = H[i]
        ans = max(ans, cnt)
    else:
        ref = H[i]
        ans = max(ans, cnt)
        cnt = 0

print(ans)
0
0
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
0
0