Submission #1736156

---

Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def main():
    N = int(input())
    h_list = []
    for _ in range(N):
        h_list.append(int(input()))

    left_down, right_down = [None] * N, [None] * N
    for i in range(N - 1, 0, -1):
        left_down[i] = h_list[i - 1] < h_list[i]
    for i in range(N - 1):
        right_down[i] = h_list[i] > h_list[i + 1]

    ans = 0
    for t in range(N):
        s, u = t, t
        for i in range(t - 1, -1, -1):
            s = i
            if left_down[i] == 0:
                break
        for i in range(t + 1, N):
            u = i
            if right_down[i] == 0:
                break
        ans = max(ans, u - s + 1)

    print(ans)


if __name__ == '__main__':
    main()

Submission Info

Judge Result