183122025-10-18 22:03:47birozsLegtöbbször szomszédok (75 pont)python3Partially correct 49/75111ms15080 KiB
N,M = map(int,input().split())
T = list(map(int,input().split()))
j = 0
maxeset = 0
while j < N and T[j] <= T[M-1]:
    j += 1
if j == N:
    print(-1)
else:
    akt = T[j]
    poz = j
    if j < M - 1:
        eset = 0
    else:
        eset = 1
    for i in range(j+1,N):
        if T[M-1] < T[i] < akt:
            if i >= M-1:
                if eset > maxeset:
                    maxeset = eset
                    maxpoz = poz
                    eset = 1
            akt = T[i]
            poz = i
        elif i >= M - 1:
            eset += 1
    if eset > maxeset:
        print(poz+1,eset)
    else:
        print(maxpoz+1,maxeset)

j = 0
maxeset = 0
while j < N and T[j] >= T[M-1]:
    j += 1
if j == N:
    print(-1)
else:
    akt = T[j]
    poz = j
    if j < M - 1:
        eset = 0
    else:
        eset = 1
    for i in range(j+1,N):
        if T[M-1] > T[i] > akt:
            if i >= M-1:
                if eset > maxeset:
                    maxeset = eset
                    maxpoz = poz
                    eset = 1
            akt = T[i]
            poz = i
        elif i >= M - 1:
            eset += 1
    if eset > maxeset:
        print(poz+1,eset)
    else:
        print(maxpoz+1,maxeset)
            
SubtaskSumTestVerdictTimeMemory
base49/75
1Accepted0/016ms3312 KiB
2Accepted0/0111ms13876 KiB
3Accepted2/217ms3112 KiB
4Accepted2/217ms3240 KiB
5Accepted4/416ms3016 KiB
6Accepted4/416ms3020 KiB
7Accepted3/317ms3244 KiB
8Partially correct2/416ms3164 KiB
9Accepted4/420ms3916 KiB
10Wrong answer0/425ms4224 KiB
11Wrong answer0/425ms4232 KiB
12Partially correct2/432ms5432 KiB
13Wrong answer0/434ms5428 KiB
14Accepted4/432ms5096 KiB
15Partially correct2/434ms5256 KiB
16Partially correct2/441ms6696 KiB
17Partially correct2/452ms8076 KiB
18Wrong answer0/459ms9064 KiB
19Accepted4/4103ms10908 KiB
20Accepted4/4105ms10924 KiB
21Accepted4/4104ms10944 KiB
22Accepted4/4107ms15080 KiB