257052026-02-27 13:58:27algoproSzomjas állatokpypy3Accepted 100/10048ms21288 KiB
# UUID: d12ac545-82c7-47cc-bebb-38870cbccb1b
N=int(input())
A=[int(x) for x in input().split()]

res=0
maxi = -1
for i in range(N-1,-1,-1):
	if A[i] >= maxi:
		res+=1
	maxi = max(maxi, A[i])

print(res)
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted37ms19436 KiB
2Accepted43ms19432 KiB
subtask25/5
3Accepted39ms19404 KiB
4Accepted43ms19500 KiB
5Accepted43ms19496 KiB
subtask320/20
6Accepted39ms19328 KiB
7Accepted43ms19536 KiB
8Accepted43ms19576 KiB
9Accepted48ms21276 KiB
10Accepted48ms21288 KiB
subtask425/25
11Accepted43ms19400 KiB
12Accepted43ms19332 KiB
13Accepted39ms19416 KiB
14Accepted39ms19548 KiB
15Accepted39ms19440 KiB
subtask520/20
16Accepted43ms19524 KiB
17Accepted39ms19424 KiB
18Accepted43ms21216 KiB
19Accepted48ms21192 KiB
20Accepted48ms19872 KiB
subtask630/30
21Accepted43ms19512 KiB
22Accepted45ms19704 KiB
23Accepted46ms19740 KiB
24Accepted43ms21228 KiB
25Accepted48ms21060 KiB
26Accepted45ms19980 KiB