[计算机软件及应用]算法设计与分析7.pptVIP

Matrix-chain multiplication Matrix-chain multiplication Matrix-chain multiplication Matrix-chain multiplication Matrix-chain multiplication Matrix-chain multiplication Matrix-chain multiplication 8 -* Computation relationships of subtrees e.g. n=4 Time complexity : O(n3) when j-i=m, there are (n-m) C(i, j)’s to compute. Each C(i, j) with j-i=m can be computed in O(m) time. 8 -* Matrix-chain multiplication n matrices A1, A2, …, An with size p0 ? p1, p1 ? p2, p2 ? p3, …, pn-1 ? pn To determine the multiplication order such that # of scalar multiplications is minimized. To compute Ai ? Ai+1, we need pi-1pipi+1 scalar multiplications. e.g. n=4, A1: 50? 10, A2: 10 ? 40, A3: 40 ? 30, A4: 30? 5 ((A1 ? A2) ? A3) ? A4, # of scalar multiplications: 50*10*40 + 50*40*30 + 50*30*5 = 87500 (A1 ? (A2 ? A3)) ? A4, # of scalar multiplications: 10 *40*30 + 50*10*30 + 50*30*5 = 34500 (A1 ? A2) ? (A3 ? A4), # of scalar multiplications: 50*10*40 + 40*30*5 + 50*40*5 =36000 8 -* Let m(i, j) denote the minimum cost for computing Ai ? Ai+1 ? … ? Aj Computation sequence : Time complexity : O(n3) 30?5 40?30 10?40 50?10 A4 A3 A2 A1 5 30 40 10 50 p4 p3 p2 p1 p0 30?5 40?30 10?40 50?10 A4 A3 A2 A1 5 30 40 10 50 p4 p3 p2 p1 p0 30?5 40?30 10?40 50?10 A4 A3 A2 A1 5 30 40 10 50 p4 p3 p2 p1 p0 30?5 40?30 10?40 50?10 A4 A3 A2 A1 5 30 40 10 50 p4 p3 p2 p1 p0 30?5 40?30 10?40 50?10 A4 A3 A2 A1 5 30 40 10 50 p4 p3 p2 p1 p0 0 4 6000 0 3 8000 12000 0 2 10500 27000 2000 0 1 4 3 2 1 0 4 3 0 3 2 2 0 2 1 1 1 0 1 4 3 2 1 s[1][4]=1, =s[1][1],s[2][4] s[2][4]=2,=s[2][2],s[3][4] s[3][4]=3,=s[3][3],s[4][4] (A1)((A2)((A3)(A4)))==A1(A2(A3A4)) void MatrixChain(int *p，int n，int **m，int **s) { //第i个矩阵本身乘积的代价为0 for (int i = 1; i = n; i++) m[i][i] = 0; //计算第i个矩阵到第j个矩阵共r+1个矩阵相乘的代价，r为i到j的间距 //取k为i到j-1，找到使m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j]最小的代价 for (int r = 1; r = n-1; r++) for (int i = 1; i = n - r; i++) { int j=i+r;