Submission #8,533

2024-01-21 15:37:48

python3

Accepted 70/70

105ms

40772 KiB

from sys import stdin
from functools import lru_cache

N = int(stdin.readline())
magassagok = [int(x) for x in stdin.readline().split()]
magassagok.append(magassagok[-1])

darab = 0
leghosszabb = -1
benne = False
mostani_hossz = 0

elozo = magassagok[0]
for i in range(1, N+1):
	mostani = magassagok[i]
	if benne and mostani == elozo:
		benne = False
		leghosszabb = max(leghosszabb, mostani_hossz+1)
		darab += 1
		mostani_hossz = 0
	if mostani != elozo:
		mostani_hossz += 1
		benne = True
	
	elozo = mostani
print(darab)
print(leghosszabb)

	Sum	Test	Verdict		Time	Memory
base	70/70
		1	Accepted	0/0	23ms	12080 KiB
		2	Accepted	0/0	103ms	33332 KiB
		3	Accepted	3/3	23ms	13088 KiB
		4	Accepted	3/3	21ms	12972 KiB
		5	Accepted	3/3	21ms	13120 KiB
		6	Accepted	3/3	23ms	13608 KiB
		7	Accepted	3/3	21ms	13732 KiB
		8	Accepted	3/3	23ms	13856 KiB
		9	Accepted	3/3	24ms	13908 KiB
		10	Accepted	3/3	24ms	13964 KiB
		11	Accepted	3/3	24ms	14040 KiB
		12	Accepted	3/3	27ms	14716 KiB
		13	Accepted	4/4	27ms	14696 KiB
		14	Accepted	4/4	63ms	25992 KiB
		15	Accepted	4/4	70ms	28484 KiB
		16	Accepted	4/4	76ms	29332 KiB
		17	Accepted	4/4	75ms	30576 KiB
		18	Accepted	4/4	86ms	32912 KiB
		19	Accepted	4/4	94ms	37276 KiB
		20	Accepted	4/4	105ms	38640 KiB
		21	Accepted	4/4	104ms	40772 KiB
		22	Accepted	4/4	100ms	36668 KiB