Buggy python submission (verdict: Runtime Error):
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]

for i in range(1, N):
    c_p[i] = c_p[i - 1] + p[i]

max_e = 0

for i in range(N - K + 1):
    e = c_p[i + K] - c_p[i]
    if e > max_e:
        max_e = e

print((max_e + K) / 2)


Fixed submission:
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]

for i in range(1, N):
    c_p[i] = c_p[i - 1] + p[i]

max_e = c_p[K - 1]

for i in range(K, N):
    e = c_p[i] - c_p[i - K]
    max_e = max(max_e, e)

print((max_e + K) / 2)

Buggy python submission (verdict: Runtime Error):
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]
for i in range(N - 1):
    c_p[i] = c_p[i - 1] + p[i]

max_e = 0

for i in range(N - K + 1):
    e = c_p[i + K] - c_p[i]
    if e > max_e:
        max_e = e

print((max_e + K) / 2)


Fixed submission:
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]

for i in range(1, N):
    c_p[i] = c_p[i - 1] + p[i]

max_e = c_p[K - 1]

for i in range(K, N):
    e = c_p[i] - c_p[i - K]
    max_e = max(max_e, e)

print((max_e + K) / 2)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

max_e = 0

for i in range(N - K + 1):
    e = 0
    for j in range(K):
        e += p[i + j]
    if e > max_e:
        max_e = e

print((max_e + K) / 2)


Fixed submission:
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]

for i in range(1, N):
    c_p[i] = c_p[i - 1] + p[i]

max_e = c_p[K - 1]

for i in range(K, N):
    e = c_p[i] - c_p[i - K]
    max_e = max(max_e, e)

print((max_e + K) / 2)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

max_e = 0

l = list(map(lambda x: (x + 1) / 2, p))

for i in range(N - K + 1):
    e = 0
    for j in range(K):
        e += l[i + j]
    if e > max_e:
        max_e = e

print(max_e)


Fixed submission:
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]

for i in range(1, N):
    c_p[i] = c_p[i - 1] + p[i]

max_e = c_p[K - 1]

for i in range(K, N):
    e = c_p[i] - c_p[i - K]
    max_e = max(max_e, e)

print((max_e + K) / 2)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

max_e = 0
l = [0] * N

for i in range(N):
    l[i] = (p[i] + 1) / 2

for i in range(N - K + 1):
    e = 0
    for j in range(K):
        e += l[i + j]
    if e > max_e:
        max_e = e

print(max_e)


Fixed submission:
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))

# cumulated value
c_p = [0] * N
c_p[0] = p[0]

for i in range(1, N):
    c_p[i] = c_p[i - 1] + p[i]

max_e = c_p[K - 1]

for i in range(K, N):
    e = c_p[i] - c_p[i - K]
    max_e = max(max_e, e)

print((max_e + K) / 2)