Submission #24,367

2026-02-10 14:45:33

python3

Wrong answer 34/40

150ms

27024 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[:]

talal = False

for i in range(K,N):
    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	34/40
		1	Accepted	0/0	16ms	3144 KiB
		2	Accepted	0/0	20ms	4176 KiB
		3	Accepted	2/2	16ms	3116 KiB
		4	Wrong answer	0/2	16ms	3124 KiB
		5	Accepted	2/2	16ms	3124 KiB
		6	Accepted	2/2	16ms	2988 KiB
		7	Accepted	2/2	16ms	3208 KiB
		8	Accepted	2/2	17ms	3352 KiB
		9	Accepted	2/2	21ms	4244 KiB
		10	Accepted	2/2	21ms	4232 KiB
		11	Accepted	2/2	20ms	4148 KiB
		12	Accepted	2/2	20ms	3988 KiB
		13	Accepted	2/2	90ms	14724 KiB
		14	Wrong answer	0/2	79ms	18404 KiB
		15	Accepted	2/2	131ms	27024 KiB
		16	Accepted	2/2	141ms	26096 KiB
		17	Accepted	2/2	125ms	26328 KiB
		18	Accepted	2/2	138ms	26328 KiB
		19	Accepted	2/2	146ms	26344 KiB
		20	Wrong answer	0/2	82ms	11516 KiB
		21	Accepted	2/2	142ms	26172 KiB
		22	Accepted	2/2	150ms	25052 KiB