164902025-05-03 18:12:53algoproFasor (40)pypy3Wrong answer 18/40293ms64000 KiB
# UUID: a0a12d8b-71a5-4f0a-a06e-b71b2185e59e
n,k=[int(x) for x in input().split()]
h=[int(x) for x in input().split()]
j=-1
for i in range(n):
    if h[i]==max(h[max(i-k,0):min(i+k+1,n-1)]):
        j=i+1
        break
print(j)
SubtaskSumTestVerdictTimeMemory
base18/40
1Accepted0/045ms19412 KiB
2Accepted0/056ms21568 KiB
3Accepted2/245ms19428 KiB
4Wrong answer0/239ms19348 KiB
5Accepted2/241ms19480 KiB
6Accepted2/246ms19508 KiB
7Accepted2/246ms19692 KiB
8Accepted2/252ms21612 KiB
9Accepted2/246ms21512 KiB
10Accepted2/256ms21560 KiB
11Accepted2/257ms21476 KiB
12Accepted2/254ms21496 KiB
13Runtime error0/2100ms64000 KiB
14Runtime error0/2114ms64000 KiB
15Runtime error0/2108ms64000 KiB
16Runtime error0/2122ms64000 KiB
17Runtime error0/2108ms64000 KiB
18Runtime error0/2126ms64000 KiB
19Time limit exceeded0/2293ms64000 KiB
20Runtime error0/293ms64000 KiB
21Runtime error0/2107ms64000 KiB
22Runtime error0/2107ms64000 KiB