参考: https://pastebin.com/1R543whN
直接用DP数组表示正解是无法进行状态转移的,换种思路,每次计算DP[i]的时候把当前第i位所有的计算都先算出来,因为本身就是确定的,这样DP[i]虽然不是这个子问题的解,但是最后的DP[-1]是正解
#
# Complete the fairCut function below.
# ref: https://pastebin.com/1R543whN
def fairCut(k, a):
#
# Write your code here.
#
a.sort()
n=len(a)
dp=[[float('inf') for _ in range(n+1)] for _ in range(n+1)]
dp[0][0]=0
for i in range(n):
for j in range(i+1):
if j>k or i-j>n-k: continue
tmp_li = dp[i][j]+a[i]*(i-j - (n-k-(i-j)))
dp[i+1][j+1]=min(dp[i+1][j+1], tmp_li)
tmp_lu = dp[i][j]+a[i]*(j - (k-j))
dp[i+1][j]=min(dp[i+1][j], tmp_lu)
return dp[n][k]