矩阵连乘问题

/*
    输入示例：
    6
    30 35 15 5 10 20 25
    DP：
            0                                             i = j
    m[i][j]=
            min(m[i][k] + m[k + 1][j] + pi-1 * pk * pj)   i < j
            (i <= k < j)
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXSIZE 100
void matrix(int[], int, int[][MAXSIZE], int[][MAXSIZE]);
int main(void)
{
    int n;
    int i;
    int p[MAXSIZE];
    int m[MAXSIZE][MAXSIZE];
    int s[MAXSIZE][MAXSIZE];
    memset(p, 0, sizeof(p));
    memset(m, 0, sizeof(m));
    memset(s, 0, sizeof(s));
    printf("please enter n:\n");
    scanf("%d", &n);
    for (i = 0; i <= n; ++i)
    {
        scanf("%d", &p[i]);
    }
    matrix(p, n, m, s);
    printf("%d\n", m[1][n]);
    return 0;
}
void matrix(int p[], int n, int m[][MAXSIZE], int s[][MAXSIZE])
{
    int i;
    int j;
    int k;
    int r;
    int temp;
    for (i = 1; i <= n; ++i)
    {
        m[i][i] = 0;
    }
    for (r = 2; r <= n; ++r)//矩阵链长度:2 -> n
    {
        for (i = 1; i <= n - r + 1; ++i)
        {
            j = i + r - 1;
            //断开点为:i
            s[i][j] = i;
            m[i][j] = m[i + 1][j] + p[i - 1] * p[i] * p[j];
            //断开点为:i + 1 -> j - 1
            for (k = i + 1; k < j; ++k)
            {
                temp = m[i][k] + m[k + 1][j] + p[i - 1] * p[k] * p[j];
                //如果小于m[i][j],则更新
                if (temp < m[i][j])
                {
                    m[i][j] = temp;
                    s[i][j] = k;
                }
            }
        }
    }
}