243712026-02-10 16:10:57Samiko4321Síkság (55)python3Wrong answer 50/55300ms15404 KiB
N = int(input())
M = list(map(int,input().split()))

lh = 1
kezdet = 1
i = 0
lkut = 0
lnut = 0


while i < N - lh:
    lk = M[i]
    ln = M[i]
    lkut = i
    lnut = i
    for j in range(i+1,N):
        if M[j] == lk:
            lkut = j
        if M[j] == ln:
            lnut = j
        if M[j] < lk:
            lk = M[j]
        elif M[j] > ln:
            ln = M[j]
        if ln - lk > 1:
            if j - i > lh:
                lh = j - i
                kezdet = i + 1
            break
    if ln - lk > 2:
        i = j
    elif ln - lk == 2:
        if M[j] == ln:
            i = lkut + 1
        if M[j] == lk:
            i = lnut + 1
    else:
        i += 1
print(lh,kezdet)
SubtaskSumTestVerdictTimeMemory
base50/55
1Accepted0/016ms3312 KiB
2Accepted0/023ms4272 KiB
3Wrong answer0/216ms3052 KiB
4Accepted2/216ms3124 KiB
5Accepted2/216ms3124 KiB
6Accepted2/216ms3132 KiB
7Accepted3/316ms3168 KiB
8Accepted2/216ms3220 KiB
9Accepted3/317ms3228 KiB
10Accepted3/324ms4280 KiB
11Accepted3/325ms3636 KiB
12Time limit exceeded0/3300ms3892 KiB
13Accepted3/3112ms15080 KiB
14Accepted3/3105ms5064 KiB
15Accepted3/375ms11424 KiB
16Accepted3/3104ms14764 KiB
17Accepted3/396ms14804 KiB
18Accepted3/3118ms15404 KiB
19Accepted3/387ms14584 KiB
20Accepted3/3112ms14628 KiB
21Accepted3/368ms8968 KiB
22Accepted3/371ms12060 KiB