矩阵连乘

#include<bits/stdc++.h>
using namespace std;
int s[100][100];
void couts(int i, int j)
{
    if(i == j) return;
    couts(i,s[i][j]);
    couts(s[i][j]+1,j);
    cout<<"Multiply A"<<i<<","<<s[i][j]<<"and A"<<s[i][j]+1<<","<<j<<endl;
}
int main()
{
    int n,p[100],m[100][100];
    scanf("%d",&n);
    for(int i = 0; i <= n; i++)scanf("%d",&p[i]);
    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++)//i为连乘子矩阵中矩阵的个数为r时第几个连乘子矩阵
        {
            int j = i + r - 1;//连乘子矩阵中最后一个矩阵的下标
            m[i][j] = m[i+1][j]+p[i-1]*p[i]*p[j];//将链A[i:j]划分为A(i:k)*A(k+1: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;}
            }
        }
    couts(1,n);
    cout<<m[1][n]<<endl;
}