Submission #25,807

2026-03-03 17:31:34

pypy3

Accepted 100/100

48ms

21232 KiB

# UUID: 118f22c8-9b0d-48cd-a916-8fb154ee2582
N = int(input())
S = list(map(int, input().split()))
stack = []
for size in S:
    while stack and stack[-1] < size:
        stack.pop()
    stack.append(size)
print(len(stack))

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	37ms	19632 KiB
		2	Accepted	43ms	19436 KiB
subtask2	5/5
		3	Accepted	39ms	19424 KiB
		4	Accepted	43ms	19420 KiB
		5	Accepted	43ms	19488 KiB
subtask3	20/20
		6	Accepted	41ms	19344 KiB
		7	Accepted	43ms	19452 KiB
		8	Accepted	39ms	19556 KiB
		9	Accepted	39ms	19864 KiB
		10	Accepted	48ms	21228 KiB
subtask4	25/25
		11	Accepted	43ms	19272 KiB
		12	Accepted	43ms	19356 KiB
		13	Accepted	39ms	19480 KiB
		14	Accepted	39ms	19344 KiB
		15	Accepted	39ms	19520 KiB
subtask5	20/20
		16	Accepted	43ms	19552 KiB
		17	Accepted	43ms	19556 KiB
		18	Accepted	43ms	21160 KiB
		19	Accepted	43ms	21180 KiB
		20	Accepted	41ms	21228 KiB
subtask6	30/30
		21	Accepted	43ms	19536 KiB
		22	Accepted	43ms	19380 KiB
		23	Accepted	39ms	19704 KiB
		24	Accepted	39ms	19960 KiB
		25	Accepted	48ms	21216 KiB
		26	Accepted	41ms	21232 KiB