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

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

int m[MAXN][MAXN], s[MAXN][MAXN];
//m[i][j]存放第i~j个矩阵相乘所需的最小代价，s[i][j]存放的是第i~j个矩阵代价最小时中间划分的位置；
int p[MAXN];
void matrixMin(int n)
{
    for(int i = 1; i <= n; i++)
        m[i][i] = 0;
    int l;
    for(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++)
            {
                int 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 matrixMax(int n)
{
    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++)
            {
                int 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 ", m[1][n]);
}

int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        for(int i = 0; i <= n; i++)
            scanf("%d", &p[i]);
        matrixMax(n);//矩阵链相乘的最大代价；
        matrixMin(n);//矩阵链相乘的最小代价；
    }
}