PTA-矩阵链相乘问题

---

问题描述

递归法

#include <iostream>
using namespace std;

const int MAX = 1005;
int p[MAX];
int m[MAX][MAX];

int LookupChain(int i, int j){
    if(m[i][j] > 0)
        return m[i][j];
    if(i == j)
        return 0;
    int u = LookupChain(i, i) + LookupChain(i+1, j) + p[i-1]*p[i]*p[j];
    for(int k=i+1; k < j; k++)
    {
        int t = LookupChain(i, k) + LookupChain(k+1, j) + p[i-1]*p[k]*p[j];
        if(t < u)
        {
            u = t;
        }
    }
    m[i][j] = u;
    return u;
}

int MemoizedMatrixChain(int n){
    for(int i=1; i <= n; i++)
    {
        for(int j=1; j <=n; j++)
        {
            m[i][j] = 0;
        }
        return LookupChain(1, n);
    }
}

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

动态规划法

#include <iostream>
using namespace std;

#define N 1000
int p[N];
int m[N][N];
int n;

int maxChain(){
    for(int i = 1; i <= n; i++)
    {
         m[i][i] = 0;
    }
    for(int i = n; i >= 1; i--)
    {
    	for(int j = i+1; j <= n; j++)
    	{
		    m[i][j] = m[i+1][j] + p[i-1]*p[i]*p[j];
            for(int k = i + 1; k < j; k++)
            {
                int tmp = m[i][k] +m[k+1][j] + p[i-1]*p[k]*p[j];
                if(tmp < m[i][j])
                   m[i][j] = tmp;
            }	
		}
    }
    return m[1][n];
}

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