112462024-07-28 07:50:49probaFasor (40)python3Wrong answer 10/40300ms27796 KiB
# Bagoly
#sor01 = '10 3'; fa = list(map(int, '1 2 3 4 5 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, i+tav)
    i+= 1
    sav = fa[i: i+2*tav+1]
print(i+tav+1)
SubtaskSumTestVerdictTimeMemory
base10/40
1Accepted0/018ms2916 KiB
2Accepted0/020ms4068 KiB
3Wrong answer0/217ms2932 KiB
4Accepted2/217ms2916 KiB
5Wrong answer0/217ms2960 KiB
6Accepted2/217ms3064 KiB
7Wrong answer0/218ms2972 KiB
8Accepted2/218ms3320 KiB
9Runtime error0/270ms4236 KiB
10Accepted2/221ms4196 KiB
11Accepted2/221ms4216 KiB
12Wrong answer0/220ms4088 KiB
13Time limit exceeded0/2298ms14664 KiB
14Runtime error0/248ms14584 KiB
15Time limit exceeded0/2298ms27256 KiB
16Time limit exceeded0/2296ms26012 KiB
17Time limit exceeded0/2296ms27532 KiB
18Time limit exceeded0/2298ms27528 KiB
19Time limit exceeded0/2298ms27796 KiB
20Wrong answer0/245ms11240 KiB
21Time limit exceeded0/2300ms26116 KiB
22Time limit exceeded0/2298ms24840 KiB