矩阵连乘

结合代码可看矩阵连乘的计算过程,由于是数组m的值沿↘方向计算得到,r的变化使得↘向右上角
移动从而得到m数组的值
最优计算次序:((A1(A2A3))(A4A5)A6)
参考矩阵s s[1][6] 1—–3——6
s[1][3] 1–1–3
s[4][6] 4–5–6
这里写图片描述

代码:


class MatrixChain {

    public void matrixChain(int[] p, int[][] m, int[][] s) {
        int n = p.length - 1;
        System.out.println(n);

        for (int i = 1; i <= n; i++) {
            m[i][i] = 0;
        }

        for (int r = 2; r <= n; r++) {
            for (int i = 1; i <= n - r + 1; i++) {
                int j = i + r - 1;
                m[i][j] = m[i + 1][j] + p[i - 1] * p[i] * p[j];
                s[i][j] = i;
                for (int k = i + 1; k < j; k++) {
                    int t = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
                    if (t < m[i][j]) {
                        m[i][j] = t;
                        s[i][j] = k;
                    }

                }
            }
        }
    }

    public void traceback(int[][] s, int i, int j) {
        if (i == j) {
            return;
        }
        traceback(s, i, s[i][j]);
        traceback(s, s[i][j] + 1, j);
        System.out.println("Multiply A" + i + "," + s[i][j] + "and A" + (s[i][j] + 1) + "," + j);
    }

    public static void main(String[] args) {
        MatrixChain mc = new MatrixChain();
        int n = 7;
        int p[] = {30, 35, 15, 5, 10, 20, 25};
        int m[][] = new int[n][n];
        int s[][] = new int[n][n];
        mc.matrixChain(p, m, s);
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < n; j++) {
                System.out.print(m[i][j] + "     ");
            }
            System.out.println();
        }
        System.out.println();
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < n; j++) {
                System.out.print(s[i][j]);
            }
            System.out.println();
        }


        mc.traceback(s, 1, 6);
    }
}

输出:

6
0 15750 7875 9375 11875 15125
0 0 2625 4375 7125 10500
0 0 0 750 2500 5375
0 0 0 0 1000 3500
0 0 0 0 0 5000
0 0 0 0 0 0

011333
002333
000333
000045
000005
000000
Multiply A2,2and A3,3
Multiply A1,1and A2,3
Multiply A4,4and A5,5
Multiply A4,5and A6,6
Multiply A1,3and A4,6

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值