矩阵链乘法

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

#define N 100
#define INF 1000000

int p[N + 1], m[N + 1][N + 1];

void matrixchain(int n) {
    memset(m, 0, sizeof(m));
    for (int r = 1; r <= (n - 1); r++) {
        for (int i = 1; i <= n; i++) {
            int j = i + r;
            m[i][j] = INF;
            for (int k = i; k < j; k++) {
                m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + p[i] * p[k + 1] * p[j + 1]);
            }
        }
    }
}

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n + 1; i++) {
        cin >> p[i];
    }
    matrixchain(n);
    cout << m[1][n] << endl;
    return 0;
}

 

来源：CSDN

作者：Just Go For It Now

链接：https://blog.csdn.net/chengsilin666/article/details/104093282