164032025-04-29 15:28:18algoproFasor (40)pypy3Accepted 40/4097ms44188 KiB
# UUID: 45de5e75-cd2d-4810-b548-5cd92c250e29
N, K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
largest = 0
dist = 0
for i in range(1, N):
	if H[largest] < H[i]:
		largest = i
		dist = 0
	else:
		dist += 1
		if dist >= K:
			break
print(largest+1)


"""
N,K=input().split()
N=int(N)
K=int(K)
A= input().split()

res=0
done = False
while not done:
    for i in range(1,K+1):
        if res+i<N:
            if int(A[res])<int(A[res+i]):
                res+=i
                i=-1
                break
        else:
            done=True
            break
    if i==K:
        done=True

print(res+1)
"""
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/043ms19528 KiB
2Accepted0/048ms21456 KiB
3Accepted2/246ms19292 KiB
4Accepted2/239ms19400 KiB
5Accepted2/239ms19428 KiB
6Accepted2/237ms19384 KiB
7Accepted2/246ms19816 KiB
8Accepted2/254ms21400 KiB
9Accepted2/254ms21480 KiB
10Accepted2/248ms21504 KiB
11Accepted2/256ms21480 KiB
12Accepted2/248ms21488 KiB
13Accepted2/267ms31216 KiB
14Accepted2/276ms32096 KiB
15Accepted2/283ms41148 KiB
16Accepted2/296ms42948 KiB
17Accepted2/285ms43864 KiB
18Accepted2/283ms44088 KiB
19Accepted2/297ms43892 KiB
20Accepted2/275ms31408 KiB
21Accepted2/283ms41180 KiB
22Accepted2/282ms44188 KiB