爱喝喜茶爱吃烤冷面的小黑黑的博客 m = [[0]*(n+1) for i in range(n+1)] #动态规划最优乘法次数记录表 s = [[0]*(n+1) for i in range(n+1)] #矩阵划分位置记录表 for r in range(1,n): #对角线垂直方向遍历 for i in range(1,n): #第r个对角线上...
爱喝喜茶爱吃烤冷面的小黑黑的博客def PolyMax(poly): #计算多边形环状运算最优解 n = len(poly) #多边形环长度 op = [item[1] for item in poly] #取出运算符 num = [item[0] for item in poly] #取出操作数 m = [[[0,0] for i in range(n+1)] ...