动态规划求解矩阵链相乘问题

#include<cstdio>
#define MAXN 200
#define INF 99999999

int p[MAXN];
int m[MAXN][MAXN], s[MAXN][MAXN];
void solve(int n)
{
    int q;
    for(int i = 1; i <= n; i++)
        m[i][i] = 0;
    for(int l = 2; l <= n; l++)
    {
        for(int i = 1; i <= n-l+1; i++)
        {
            int j = i + l - 1;
            m[i][j] = INF;
            for(int k = i; k <= j-1; k++)
            {
                q = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];
                if(q < m[i][j])
                {
                    m[i][j] = q;
                    s[i][j] = k;
                }
            }
        }
    }
    printf("%d\n", m[1][n]);
}

void print(int i, int j)
{
    if(i == j)
        printf("A%d", i);
    else
    {
        printf("(");
        print(i, s[i][j]);
        print(s[i][j]+1, j)