183182025-10-19 22:35:39algoproSípálya (55 pont)pypy3Time limit exceeded 18/55503ms49660 KiB
# UUID: d1e06b55-97ef-4d70-aa3d-5b85d498a721
N, K = map(int, input().split())
A = list(map(int, input().split()))

min_cost = float("inf")

for i in range(N - K + 1):
    H_needed = max(A[i + t] + t for t in range(K))
    cost = sum(H_needed - (A[i + t] + t) for t in range(K))
    min_cost = min(min_cost, cost)

print(min_cost)
SubtaskSumTestVerdictTimeMemory
base18/55
1Accepted0/039ms19444 KiB
2Accepted0/045ms19396 KiB
3Accepted2/272ms21864 KiB
4Accepted2/278ms21984 KiB
5Accepted2/264ms21992 KiB
6Accepted2/264ms21960 KiB
7Accepted3/372ms21736 KiB
8Accepted1/1192ms23296 KiB
9Accepted1/1211ms23108 KiB
10Accepted1/1233ms23008 KiB
11Accepted1/1317ms23016 KiB
12Accepted1/1317ms22760 KiB
13Time limit exceeded0/1490ms23268 KiB
14Time limit exceeded0/2501ms23628 KiB
15Accepted2/2326ms23016 KiB
16Time limit exceeded0/2483ms48504 KiB
17Time limit exceeded0/2495ms48232 KiB
18Time limit exceeded0/2485ms48240 KiB
19Time limit exceeded0/3499ms47956 KiB
20Time limit exceeded0/2481ms48212 KiB
21Time limit exceeded0/2490ms48236 KiB
22Time limit exceeded0/2493ms47960 KiB
23Time limit exceeded0/2503ms48220 KiB
24Time limit exceeded0/2492ms49660 KiB
25Time limit exceeded0/2483ms48212 KiB
26Time limit exceeded0/2486ms48212 KiB
27Time limit exceeded0/2500ms48036 KiB
28Time limit exceeded0/3490ms48228 KiB
29Time limit exceeded0/3479ms47972 KiB
30Time limit exceeded0/3481ms48184 KiB