文件名称:ADSF
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 5kb
- 下载次数：
- 0次
- 提 供 者：
- 杨**
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
给定n个矩阵A1，A2，…，An，其中，Ai与Aj+1是可乘的，i=1，2，…，n-1。
你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。
-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is a mere of, i = 1,2, ..., n-1. Your task is to determine the matrix multiplication operation with the order, the computation of the n matrix product A1A2 ... An even when the multiplication of the total number of elements to a minimum. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the product A1A2A3 even when calculated according to (A1A2) A3 multiplication of the number of elements required to achieve at least for 7500.
你的任务是要确定矩阵连乘的运算次序，使计算这n个矩阵的连乘积A1A2…An时总的元素乘法次数达到最少。
例如：3个矩阵A1，A2，A3，阶分别为10×100、100×5、5×50，计算连乘积A1A2A3时按（A1A2）A3所需的元素乘法次数达到最少，为7500次。
-Given n matrices A1, A2, ..., An, which, Ai and Aj+1 is a mere of, i = 1,2, ..., n-1. Your task is to determine the matrix multiplication operation with the order, the computation of the n matrix product A1A2 ... An even when the multiplication of the total number of elements to a minimum. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the product A1A2A3 even when calculated according to (A1A2) A3 multiplication of the number of elements required to achieve at least for 7500.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ADSF\ADSF.dsp
....\ADSF.dsw
....\ADSF.ncb
....\ADSF.opt
....\DF.CPP
....\Debug
ADSF
....\ADSF.dsw
....\ADSF.ncb
....\ADSF.opt
....\DF.CPP
....\Debug
ADSF