文件名称:tt
介绍说明－－下载内容均来自于网络，请自行研究使用
算法设计与分析 习题部分解
比如：由于矩阵乘法满足结合律，所以计算矩阵的连乘可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。
若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积
-Algorithm design and analysis of some solutions of exercises to meet the combination of matrix multiplication in the law, so even by calculating the matrix can be calculated many different order. This calculation can be bracketed sequence manner. Even if the product of a matrix calculation to determine the order entirely, that is to say the company has completely bracketed product, you can repeatedly call and so the order of two standard matrix multiplication algorithm to calculate the product matrix even
比如：由于矩阵乘法满足结合律，所以计算矩阵的连乘可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。
若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积
-Algorithm design and analysis of some solutions of exercises to meet the combination of matrix multiplication in the law, so even by calculating the matrix can be calculated many different order. This calculation can be bracketed sequence manner. Even if the product of a matrix calculation to determine the order entirely, that is to say the company has completely bracketed product, you can repeatedly call and so the order of two standard matrix multiplication algorithm to calculate the product matrix even
(系统自动生成,下载前可以参看下载内容)
下载文件列表
习题
....\n后问题.txt
....\众数问题.txt
....\区间覆盖问题.cpp
....\半数集问题与半数单集问题.txt
....\图的m着色问题.txt
....\多处最优服务次序问题.txt
....\循环赛日程表.cxx
....\批处理作业调度(回朔).cpp
....\整数划分问题.cpp
....\整数因子分解问题.cpp
....\最优分解问题.txt
....\最佳调度问题.txt
....\最大子段和-1.cpp
....\最大子段和-II.cpp
....\最大子段和.cpp
....\最小生成树.txt
....\矩阵连乘积-输出最优解.txt
....\离散01串问题.cpp
....\程序存储问题.cpp
....\程序存储问题.txt
....\程序最优存储问题.txt
....\编辑距离问题.cpp
....\邮局选址问题.cpp
....\n后问题.txt
....\众数问题.txt
....\区间覆盖问题.cpp
....\半数集问题与半数单集问题.txt
....\图的m着色问题.txt
....\多处最优服务次序问题.txt
....\循环赛日程表.cxx
....\批处理作业调度(回朔).cpp
....\整数划分问题.cpp
....\整数因子分解问题.cpp
....\最优分解问题.txt
....\最佳调度问题.txt
....\最大子段和-1.cpp
....\最大子段和-II.cpp
....\最大子段和.cpp
....\最小生成树.txt
....\矩阵连乘积-输出最优解.txt
....\离散01串问题.cpp
....\程序存储问题.cpp
....\程序存储问题.txt
....\程序最优存储问题.txt
....\编辑距离问题.cpp
....\邮局选址问题.cpp