194622025-12-09 19:29:41birozsSípálya (55 pont)python3Wrong answer 6/55501ms27636 KiB
N,K=map(int,input().split())
T = list(map(int,input().split()))
def novel(H):
    fold = 0
    poz = H[-1]+len(H)-1
    kilog = []
    for m in H:
        kilog.append(m-poz)
        poz -= 1
    eltolas = max(kilog)
    for k in kilog:
        fold += eltolas - k
    return fold

minhord = 10**9
for i in range(len(T)-K):
    aktnovel = novel(T[i:i+K])
    if aktnovel < minhord:
        minhord = aktnovel
print(minhord)
SubtaskSumTestVerdictTimeMemory
base6/55
1Accepted0/017ms3100 KiB
2Accepted0/016ms3012 KiB
3Accepted2/218ms3220 KiB
4Accepted2/218ms3008 KiB
5Accepted2/232ms3216 KiB
6Wrong answer0/245ms3220 KiB
7Wrong answer0/343ms3220 KiB
8Time limit exceeded0/1495ms4104 KiB
9Time limit exceeded0/1455ms4156 KiB
10Time limit exceeded0/1499ms4256 KiB
11Time limit exceeded0/1495ms4260 KiB
12Time limit exceeded0/1488ms4256 KiB
13Time limit exceeded0/1483ms4232 KiB
14Time limit exceeded0/2479ms4140 KiB
15Time limit exceeded0/2493ms4256 KiB
16Time limit exceeded0/2476ms27480 KiB
17Time limit exceeded0/2500ms27636 KiB
18Time limit exceeded0/2490ms24976 KiB
19Time limit exceeded0/3501ms26332 KiB
20Time limit exceeded0/2500ms26316 KiB
21Time limit exceeded0/2500ms25040 KiB
22Time limit exceeded0/2479ms26340 KiB
23Time limit exceeded0/2501ms26412 KiB
24Time limit exceeded0/2483ms24992 KiB
25Time limit exceeded0/2501ms26328 KiB
26Time limit exceeded0/2483ms26328 KiB
27Time limit exceeded0/2501ms26332 KiB
28Time limit exceeded0/3481ms25048 KiB
29Time limit exceeded0/3500ms26348 KiB
30Time limit exceeded0/3500ms26280 KiB