Submission #16,246

2025-04-15 17:01:58

python3

Accepted 70/70

74ms

15180 KiB

n = int(input())
m = [int(x) for x in input().split()]

r= [m[0]]
sz = []

for i in range(1,n):
    if r[-1] == m[i]:
        if len(r) > 1:
            sz.append(r)
        r = [m[i]]
    else:
        r.append(m[i])
if len(r) > 1:
    sz.append(r)
print(len(sz))
if len(sz) > 0:
    print(max([len(r) for r in sz]))
else:
    print(-1)

	Sum	Test	Verdict		Time	Memory
base	70/70
		1	Accepted	0/0	16ms	3116 KiB
		2	Accepted	0/0	70ms	13368 KiB
		3	Accepted	3/3	16ms	3116 KiB
		4	Accepted	3/3	16ms	3112 KiB
		5	Accepted	3/3	16ms	3052 KiB
		6	Accepted	3/3	16ms	3120 KiB
		7	Accepted	3/3	16ms	3024 KiB
		8	Accepted	3/3	16ms	3040 KiB
		9	Accepted	3/3	16ms	3124 KiB
		10	Accepted	3/3	17ms	3140 KiB
		11	Accepted	3/3	17ms	3136 KiB
		12	Accepted	3/3	17ms	3380 KiB
		13	Accepted	4/4	18ms	3380 KiB
		14	Accepted	4/4	43ms	8660 KiB
		15	Accepted	4/4	48ms	9936 KiB
		16	Accepted	4/4	54ms	10332 KiB
		17	Accepted	4/4	54ms	10344 KiB
		18	Accepted	4/4	57ms	11220 KiB
		19	Accepted	4/4	64ms	13472 KiB
		20	Accepted	4/4	71ms	13356 KiB
		21	Accepted	4/4	74ms	15180 KiB
		22	Accepted	4/4	63ms	12248 KiB