1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
# Author: Bartek Knapik

from collections import deque

n = int(input())
a = [int(el) for el in input().split()]

best_pearls = deque([])

cur_max = 0
for pos in range(n):
    if a[pos] > cur_max:
        cur_max = a[pos]
        best_pearls.append((a[pos], pos))

best_res = len(best_pearls)

for pos in range(n-1,0,-1):
    if best_pearls[-1][1] == pos:
        best_pearls.pop()
    while len(best_pearls) and best_pearls[0][0] <= a[pos]:
        best_pearls.popleft()
    best_pearls.appendleft((a[pos], pos))
    if len(best_pearls) > best_res:
        best_res = len(best_pearls)

print(best_res)