112162024-07-16 23:54:48probaFasor (40)python3Wrong answer 8/40300ms27944 KiB
#Bagoly
elso = list(map(int, input().split()))
fa = elso[0]
tav = elso[1]
sor = list(map(int, input().split()))
# print(fa, tav)
i = tav
while i < len(sor)-tav and max(sor[i-tav: i+tav]) > sor[i]:
    i += 1
    
print(i+1 if i < len(sor)-tav else -1)
SubtaskSumTestVerdictTimeMemory
base8/40
1Accepted0/017ms2916 KiB
2Accepted0/020ms4068 KiB
3Wrong answer0/217ms2980 KiB
4Wrong answer0/217ms2980 KiB
5Wrong answer0/217ms2844 KiB
6Accepted2/217ms2968 KiB
7Wrong answer0/217ms3172 KiB
8Accepted2/219ms3320 KiB
9Wrong answer0/271ms3980 KiB
10Accepted2/220ms4076 KiB
11Accepted2/221ms4140 KiB
12Wrong answer0/219ms3960 KiB
13Time limit exceeded0/2296ms14556 KiB
14Wrong answer0/248ms14712 KiB
15Time limit exceeded0/2293ms27356 KiB
16Time limit exceeded0/2294ms26012 KiB
17Time limit exceeded0/2298ms27656 KiB
18Time limit exceeded0/2298ms27676 KiB
19Time limit exceeded0/2298ms27944 KiB
20Wrong answer0/241ms11256 KiB
21Time limit exceeded0/2300ms26072 KiB
22Time limit exceeded0/2300ms24968 KiB