Submission #24,368

2026-02-10 14:57:41

python3

Accepted 40/40

156ms

26440 KiB

N,K = map(int,input().split())
H = list(map(int,input().split()))

for i in range(1,N):
    if H[i] < H[i-1]:
        H[i] = H[i-1]

seged = [0]*K

H = seged[:] + H[:]

seged = [H[-1]]*K

H = H[:] + seged[:]

talal = False

for i in range(K,N+K):
    if H[i-K] <= H[i] and H[i+K] <= H[i]:
        print(i-K+1)
        talal = True
        break
    
if talal == False:
    print(-1)

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	16ms	3108 KiB
		2	Accepted	0/0	23ms	4224 KiB
		3	Accepted	2/2	16ms	3116 KiB
		4	Accepted	2/2	16ms	3124 KiB
		5	Accepted	2/2	17ms	2960 KiB
		6	Accepted	2/2	17ms	3124 KiB
		7	Accepted	2/2	17ms	3072 KiB
		8	Accepted	2/2	17ms	3328 KiB
		9	Accepted	2/2	21ms	4240 KiB
		10	Accepted	2/2	21ms	4276 KiB
		11	Accepted	2/2	20ms	4356 KiB
		12	Accepted	2/2	21ms	3772 KiB
		13	Accepted	2/2	94ms	14768 KiB
		14	Accepted	2/2	128ms	20172 KiB
		15	Accepted	2/2	136ms	26200 KiB
		16	Accepted	2/2	143ms	26092 KiB
		17	Accepted	2/2	143ms	26440 KiB
		18	Accepted	2/2	133ms	26328 KiB
		19	Accepted	2/2	143ms	24904 KiB
		20	Accepted	2/2	82ms	11296 KiB
		21	Accepted	2/2	150ms	26164 KiB
		22	Accepted	2/2	156ms	25092 KiB