112452024-07-28 07:47:10probaFasor (40)python3Wrong answer 2/4018ms3064 KiB
# Bagoly
sor01 = '10 3'; fa = list(map(int, '12 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
sav = fa[i: i+2*tav+1]
while max(sav) != fa[i+tav]:
    #print(sav, fa[i+tav])
    i+= 1
    sav = fa[i: i+2*tav+1]
print(i+tav+1)
SubtaskSumTestVerdictTimeMemory
base2/40
1Wrong answer0/018ms2920 KiB
2Wrong answer0/017ms2932 KiB
3Wrong answer0/218ms2956 KiB
4Wrong answer0/217ms2916 KiB
5Wrong answer0/218ms2916 KiB
6Wrong answer0/217ms2972 KiB
7Accepted2/217ms3044 KiB
8Wrong answer0/217ms3056 KiB
9Wrong answer0/217ms2936 KiB
10Wrong answer0/217ms2916 KiB
11Wrong answer0/217ms2916 KiB
12Wrong answer0/217ms2916 KiB
13Wrong answer0/217ms2916 KiB
14Wrong answer0/217ms2844 KiB
15Wrong answer0/217ms2916 KiB
16Wrong answer0/217ms3064 KiB
17Wrong answer0/217ms2948 KiB
18Wrong answer0/217ms2936 KiB
19Wrong answer0/217ms2936 KiB
20Wrong answer0/217ms2932 KiB
21Wrong answer0/217ms3064 KiB
22Wrong answer0/217ms2916 KiB