Sample Flowchart Template
2016-04-20 16:34:20 2 举报
流程图
作者其他创作
大纲/内容
Initialize t[i][j]
The chain ij is divided into(A [i: k]) * (A [k + 1: j])
Start
Compute the back boundary of the chain with the front edge r and the chain length r
Read the txt file to store the data in the array arr.
End
Returns t [1] [n]
NO
Outputs the minimum weight
YES
Determine whether the last boundary
Output the triangles for the split
Calculate the minimum weight
Backtracking Constructs a triangle
0 条评论
回复 删除
下一页
