112432024-07-28 07:36:51probaFasor (40)python3Wrong answer 0/40300ms27800 KiB
# Bagoly
#sor01 = '10 3'
sor01 = input()
fszam, tav = int(sor01.split(' ')[0]), int(sor01.split(' ')[1])
fa = list(map(int, input().split(' ')))
#fa = list(map(int, '6 2 1 8 4 8 7 12 9 3'.split(' ')))
i = 0
while i < len(fa)-(2*tav):
    sav = fa[i: i+2*tav+1]
    if max(sav) <= fa[i]:
        break
    i+= 1
print(i)
SubtaskSumTestVerdictTimeMemory
base0/40
1Accepted0/018ms2960 KiB
2Wrong answer0/023ms4068 KiB
3Wrong answer0/218ms2824 KiB
4Wrong answer0/217ms2960 KiB
5Wrong answer0/217ms2916 KiB
6Wrong answer0/217ms2916 KiB
7Wrong answer0/217ms3044 KiB
8Wrong answer0/219ms3320 KiB
9Wrong answer0/220ms3996 KiB
10Wrong answer0/220ms4056 KiB
11Wrong answer0/225ms4076 KiB
12Wrong answer0/220ms3960 KiB
13Time limit exceeded0/2298ms14536 KiB
14Wrong answer0/245ms14628 KiB
15Time limit exceeded0/2296ms27436 KiB
16Time limit exceeded0/2300ms26012 KiB
17Time limit exceeded0/2300ms27676 KiB
18Time limit exceeded0/2300ms27528 KiB
19Time limit exceeded0/2298ms27800 KiB
20Wrong answer0/243ms11048 KiB
21Time limit exceeded0/2300ms26000 KiB
22Time limit exceeded0/2300ms24984 KiB