Submission #25,812

2026-03-03 18:04:40

pypy3

Accepted 100/100

50ms

21228 KiB

# UUID: c3501d3a-be8e-46b5-97c6-5f49e54468eb
n = int(input())
sizes = list(map(int, input().split()))

stack = []

for size in sizes:
    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	19436 KiB
		2	Accepted	43ms	19440 KiB
subtask2	5/5
		3	Accepted	39ms	19568 KiB
		4	Accepted	43ms	19444 KiB
		5	Accepted	43ms	19340 KiB
subtask3	20/20
		6	Accepted	43ms	19388 KiB
		7	Accepted	39ms	19676 KiB
		8	Accepted	43ms	19768 KiB
		9	Accepted	39ms	19952 KiB
		10	Accepted	48ms	21228 KiB
subtask4	25/25
		11	Accepted	43ms	19316 KiB
		12	Accepted	39ms	19424 KiB
		13	Accepted	39ms	19392 KiB
		14	Accepted	43ms	19432 KiB
		15	Accepted	43ms	19472 KiB
subtask5	20/20
		16	Accepted	39ms	19488 KiB
		17	Accepted	39ms	19412 KiB
		18	Accepted	48ms	21116 KiB
		19	Accepted	48ms	21176 KiB
		20	Accepted	43ms	21228 KiB
subtask6	30/30
		21	Accepted	45ms	19300 KiB
		22	Accepted	39ms	19624 KiB
		23	Accepted	43ms	19664 KiB
		24	Accepted	39ms	20104 KiB
		25	Accepted	50ms	21224 KiB
		26	Accepted	43ms	21204 KiB