dynamic-planning

所属分类:数据结构
开发工具:C/C++
文件大小:1KB
下载次数:2
上传日期:2011-06-23 10:42:03
上 传 者hhhhtesthhh
说明:  给定n个矩阵{A1,A2,…,An},其中Ai与Ai+1是可乘的,i=1,2,…,n-1。考察这n个矩阵的连乘积A1A2…An。由于矩阵乘法满足结合律,故计算矩阵的连乘积可以有许多不同的计算次序,这种计算次序可以用加括号的方式来确定。
(Given n matrices {A1, A2, ..., An}, where Ai and Ai+1 is a mere of, i = 1,2, ..., n-1. Study the n matrix with the product A1A2 ... An. Since matrix multiplication to meet with law, so the calculation of the matrix with the product can have many different ways to calculate the order, the order of this calculation can be used to determine the way in parentheses.)

文件列表:
矩阵连乘最优解——动态规划.cpp (1683, 2011-05-22)

近期下载者

相关文件


收藏者