Submission #19,741

19741

2025-12-20 21:27:44

python3

Accepted 55/55

123ms

14816 KiB

N = int(input())
T = list(map(int,input().split()))
a = T[0]
akezd = 0
maxhossz = 0
b = 0
for i in range(1,N):
    if abs(T[i] - a) == 1 and b == 0:
        b = T[i]
        bkezd = i
    elif abs(T[i] - a) == 1 and b != 0 and abs(T[i] - b) > 1:
        if i - akezd > maxhossz:
            maxhossz = i - akezd
            maxkezdo = akezd + 1
        if T[i-1] == b:
            a = T[i]
            akezd = i
            b = 0
        else:  
            j = i - 1
            while T[j] == a:
                j -= 1
            akezd = j + 1
            b = T[i]
            bkezd = i
    elif abs(T[i] - a) > 1:
        if i - akezd > maxhossz:
            maxhossz = i - akezd
            maxkezdo = akezd + 1
        if b != 0 and abs(T[i] - b) == 1 and T[i-1] == b:
            j = i - 1
            while j > bkezd and T[j] == b:
                j -= 1
            a = b
            if j == bkezd:
                akezd = j
            else:
                akezd = j + 1
            b = T[i]
            bkezd = i
        else:
            a = T[i]
            akezd = i
            b = 0
if N - akezd > maxhossz:
    maxhossz = N - akezd
    maxkezdo = akezd + 1
print(maxhossz, maxkezdo)

	Sum	Test	Verdict		Time	Memory
base	55/55
		1	Accepted	0/0	17ms	3140 KiB
		2	Accepted	0/0	25ms	4356 KiB
		3	Accepted	2/2	16ms	3120 KiB
		4	Accepted	2/2	16ms	3120 KiB
		5	Accepted	2/2	17ms	3124 KiB
		6	Accepted	2/2	17ms	3368 KiB
		7	Accepted	3/3	17ms	3116 KiB
		8	Accepted	2/2	17ms	3284 KiB
		9	Accepted	3/3	17ms	3144 KiB
		10	Accepted	3/3	26ms	4148 KiB
		11	Accepted	3/3	25ms	3636 KiB
		12	Accepted	3/3	24ms	4044 KiB
		13	Accepted	3/3	107ms	14604 KiB
		14	Accepted	3/3	98ms	5060 KiB
		15	Accepted	3/3	103ms	11664 KiB
		16	Accepted	3/3	108ms	14732 KiB
		17	Accepted	3/3	105ms	14740 KiB
		18	Accepted	3/3	123ms	14816 KiB
		19	Accepted	3/3	104ms	14544 KiB
		20	Accepted	3/3	112ms	14700 KiB
		21	Accepted	3/3	71ms	9008 KiB
		22	Accepted	3/3	85ms	12536 KiB