文件名称:JuZhenLianCheng
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 6kb
- 下载次数：
- 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次。
-Descr iption of the problem given n matrices A1, A2, ..., An, which, Ai and Aj+ 1 is the multiplicative, i = 1,2, ..., n-1. Your mission is to identify the matrix even by computing the order, so that calculation of this n-matrix product A1A2 ... An even when the total number of elements to achieve a minimum of multiplication. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the calculation even when the product A1A2A3 by (A1A2) A3 multiply the number of elements required to achieve at least for the 7500 meeting.
给定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次。
-Descr iption of the problem given n matrices A1, A2, ..., An, which, Ai and Aj+ 1 is the multiplicative, i = 1,2, ..., n-1. Your mission is to identify the matrix even by computing the order, so that calculation of this n-matrix product A1A2 ... An even when the total number of elements to achieve a minimum of multiplication. For example: three matrices A1, A2, A3, bands were 10 × 100,100 × 5,5 × 50, the calculation even when the product A1A2A3 by (A1A2) A3 multiply the number of elements required to achieve at least for the 7500 meeting.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Ex_1
....\ex_1.cpp
....\Ex_1.dsp
....\Ex_1.dsw
....\Ex_1.ncb
....\Ex_1.opt
....\Ex_1.plg
....\ex_1.cpp
....\Ex_1.dsp
....\Ex_1.dsw
....\Ex_1.ncb
....\Ex_1.opt
....\Ex_1.plg