Submission #1213443

---

Source Code Expand

from itertools import combinations
n, k = map(int, raw_input().split())
a = map(int, raw_input().split())
ans = 10 ** 12
for p in combinations(range(n), k):
    p = list(p)[::-1]
    ma = 0
    res = 0
    for j in xrange(n):
        if p and j == p[-1]:
            if ma < a[j]:
                ma = a[j]
            else:
                res += ma + 1 - a[j]
                ma += 1
            p.pop()
        else:
            if ma < a[j]:
                ma = a[j]
    if ans > res:
        ans = res
print ans

Submission Info

Judge Result