112442024-07-28 07:39:48probaFasor (40)python3Wrong answer 0/4017ms3188 KiB
# Bagoly
sor01 = '10 3'; fa = list(map(int, '6 2 1 8 4 8 7 12 9 3'.split(' ')))
#sor01 = input(); fa = list(map(int, input().split(' ')))
fszam, tav = int(sor01.split(' ')[0]), int(sor01.split(' ')[1])


i = 0
while True:
    sav = fa[i: i+2*tav+1]
    if max(sav) <= fa[i+tav]:
        break
    i+= 1
print(i+tav+1)
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/017ms2916 KiB
2Wrong answer0/017ms2916 KiB
3Wrong answer0/217ms2916 KiB
4Wrong answer0/217ms2916 KiB
5Wrong answer0/217ms2852 KiB
6Wrong answer0/217ms2916 KiB
7Wrong answer0/217ms3064 KiB
8Wrong answer0/217ms3188 KiB
9Wrong answer0/217ms2936 KiB
10Wrong answer0/217ms2844 KiB
11Wrong answer0/217ms2980 KiB
12Wrong answer0/217ms2960 KiB
13Wrong answer0/217ms2916 KiB
14Wrong answer0/217ms2788 KiB
15Wrong answer0/217ms3060 KiB
16Wrong answer0/217ms2916 KiB
17Wrong answer0/217ms2936 KiB
18Wrong answer0/217ms2960 KiB
19Wrong answer0/217ms2936 KiB
20Wrong answer0/217ms2860 KiB
21Wrong answer0/217ms2972 KiB
22Wrong answer0/217ms2844 KiB