解题思路
(27条消息) 动态规划之合并石子_Zekary的博客-CSDN博客_石子合并问题动态规划
注意事项:
参考代码:
from cmath import inf def f(n): dp = [[inf for j in range(n+1)] for i in range(n+1)] for i in range(n+1): dp[i][i] = 0 for t in range(1,n): for i in range(1,n-t+1): j = i + t for k in range(i,j): dp[i][j] = min(dp[i][j],dp[i][k]+dp[k+1][j]+sum(A[i:j+1])) print(dp[1][n]) if __name__ == '__main__': n = int(input().strip()) A = [0] + [int(i) for i in input().strip().split()] f(n)
0.0分
1 人评分