[商管] 台北 99資管 資料結構
Given a chain A1*A2*A3*A4*A5 where A1(6*7) A2(7*3) A3(3*5) A4(5*8) A5(8*4)
. Whatis the minimum cost for computing A1*A2*A3*A4*A5 and 矩陣相乘之順序?
(For example,the cost for A1*A2 is 6*7*3 = 126)
想請問這題怎麼解
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.225.133.126
推
03/11 14:31, , 1F
03/11 14:31, 1F
→
03/11 14:32, , 2F
03/11 14:32, 2F
推
03/11 15:30, , 3F
03/11 15:30, 3F
→
03/11 19:56, , 4F
03/11 19:56, 4F
推
03/11 23:08, , 5F
03/11 23:08, 5F
→
03/11 23:28, , 6F
03/11 23:28, 6F
推
03/12 19:55, , 7F
03/12 19:55, 7F
→
03/12 19:55, , 8F
03/12 19:55, 8F
推
03/13 17:51, , 9F
03/13 17:51, 9F
→
03/13 17:51, , 10F
03/13 17:51, 10F
→
09/11 14:20, , 11F
09/11 14:20, 11F