Submission #16,245

2025-04-15 16:59:23

python3

Accepted 70/70

72ms

15192 KiB

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

r= []
sz = []

for i in range(n):
    if i == 0:
        r.append(m[i])
    else:
        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	3112 KiB
		2	Accepted	0/0	71ms	13564 KiB
		3	Accepted	3/3	16ms	3108 KiB
		4	Accepted	3/3	16ms	3124 KiB
		5	Accepted	3/3	17ms	3124 KiB
		6	Accepted	3/3	17ms	3124 KiB
		7	Accepted	3/3	16ms	3012 KiB
		8	Accepted	3/3	17ms	3124 KiB
		9	Accepted	3/3	17ms	3212 KiB
		10	Accepted	3/3	17ms	3124 KiB
		11	Accepted	3/3	17ms	3124 KiB
		12	Accepted	3/3	17ms	3212 KiB
		13	Accepted	4/4	17ms	3436 KiB
		14	Accepted	4/4	46ms	8816 KiB
		15	Accepted	4/4	50ms	9984 KiB
		16	Accepted	4/4	54ms	10176 KiB
		17	Accepted	4/4	57ms	10404 KiB
		18	Accepted	4/4	59ms	11220 KiB
		19	Accepted	4/4	72ms	13476 KiB
		20	Accepted	4/4	72ms	13372 KiB
		21	Accepted	4/4	71ms	15192 KiB
		22	Accepted	4/4	68ms	12168 KiB